/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_13.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:17:32,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:17:32,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:17:32,764 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:17:32,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:17:32,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:17:32,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:17:32,768 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:17:32,769 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:17:32,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:17:32,770 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:17:32,771 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:17:32,771 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:17:32,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:17:32,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:17:32,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:17:32,775 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:17:32,775 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:17:32,777 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:17:32,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:17:32,788 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:17:32,790 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:17:32,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:17:32,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:17:32,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:17:32,794 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:17:32,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:17:32,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:17:32,795 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:17:32,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:17:32,796 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:17:32,797 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:17:32,797 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:17:32,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:17:32,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:17:32,799 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:17:32,799 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:17:32,799 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:17:32,800 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:17:32,800 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:17:32,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:17:32,801 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:17:32,801 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:17:32,809 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:17:32,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:17:32,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:17:32,810 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:17:32,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:17:32,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:17:32,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:17:32,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:17:32,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:17:32,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:17:32,817 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:17:32,818 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:17:32,818 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:17:32,818 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:17:32,818 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:17:32,818 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:17:32,818 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:17:32,818 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:17:32,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:17:32,819 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:17:32,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:17:32,819 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:17:32,820 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:17:32,820 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:17:32,820 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:17:32,820 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 08:17:33,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:17:33,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:17:33,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:17:33,030 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:17:33,032 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:17:33,033 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_13.c [2022-04-08 08:17:33,085 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9238381b1/755123d25d8640428d5b2037face42e5/FLAG734b483c5 [2022-04-08 08:17:33,429 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:17:33,429 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c [2022-04-08 08:17:33,435 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9238381b1/755123d25d8640428d5b2037face42e5/FLAG734b483c5 [2022-04-08 08:17:33,851 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9238381b1/755123d25d8640428d5b2037face42e5 [2022-04-08 08:17:33,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:17:33,854 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:17:33,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:17:33,857 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:17:33,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:17:33,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:17:33" (1/1) ... [2022-04-08 08:17:33,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cb6886f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:33, skipping insertion in model container [2022-04-08 08:17:33,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:17:33" (1/1) ... [2022-04-08 08:17:33,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:17:33,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:17:34,036 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c[4936,4949] [2022-04-08 08:17:34,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:17:34,046 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:17:34,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c[4936,4949] [2022-04-08 08:17:34,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:17:34,081 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:17:34,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:34 WrapperNode [2022-04-08 08:17:34,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:17:34,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:17:34,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:17:34,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:17:34,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:34" (1/1) ... [2022-04-08 08:17:34,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:34" (1/1) ... [2022-04-08 08:17:34,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:34" (1/1) ... [2022-04-08 08:17:34,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:34" (1/1) ... [2022-04-08 08:17:34,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:34" (1/1) ... [2022-04-08 08:17:34,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:34" (1/1) ... [2022-04-08 08:17:34,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:34" (1/1) ... [2022-04-08 08:17:34,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:17:34,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:17:34,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:17:34,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:17:34,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:34" (1/1) ... [2022-04-08 08:17:34,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:17:34,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:17:34,163 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 08:17:34,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 08:17:34,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:17:34,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:17:34,196 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:17:34,196 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:17:34,196 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:17:34,197 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:17:34,197 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:17:34,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:17:34,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:17:34,197 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:17:34,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:17:34,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:17:34,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:17:34,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:17:34,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:17:34,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:17:34,275 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:17:34,280 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:17:34,518 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:17:34,525 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:17:34,525 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:17:34,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:17:34 BoogieIcfgContainer [2022-04-08 08:17:34,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:17:34,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:17:34,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:17:34,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:17:34,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:17:33" (1/3) ... [2022-04-08 08:17:34,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfd7c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:17:34, skipping insertion in model container [2022-04-08 08:17:34,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:34" (2/3) ... [2022-04-08 08:17:34,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfd7c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:17:34, skipping insertion in model container [2022-04-08 08:17:34,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:17:34" (3/3) ... [2022-04-08 08:17:34,533 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2022-04-08 08:17:34,537 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:17:34,537 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:17:34,574 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:17:34,579 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 08:17:34,579 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:17:34,593 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 49 states have internal predecessors, (91), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:17:34,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 08:17:34,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:34,601 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:34,601 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:34,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:34,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1751582771, now seen corresponding path program 1 times [2022-04-08 08:17:34,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:34,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1535903633] [2022-04-08 08:17:34,622 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:34,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1751582771, now seen corresponding path program 2 times [2022-04-08 08:17:34,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:34,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011846876] [2022-04-08 08:17:34,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:34,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:34,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:34,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {57#true} is VALID [2022-04-08 08:17:34,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#true} assume true; {57#true} is VALID [2022-04-08 08:17:34,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57#true} {57#true} #251#return; {57#true} is VALID [2022-04-08 08:17:34,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {63#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:34,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {57#true} is VALID [2022-04-08 08:17:34,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2022-04-08 08:17:34,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #251#return; {57#true} is VALID [2022-04-08 08:17:34,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret18 := main(); {57#true} is VALID [2022-04-08 08:17:34,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {57#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {57#true} is VALID [2022-04-08 08:17:34,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {57#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {57#true} is VALID [2022-04-08 08:17:34,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {57#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {57#true} is VALID [2022-04-08 08:17:34,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {57#true} assume 0 != ~p1~0;~lk1~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:34,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {62#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {62#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:34,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:34,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:34,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:34,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:34,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:34,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:34,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:34,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {62#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {62#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:34,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:34,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:34,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {62#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:34,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {62#(= main_~lk1~0 1)} assume 0 != ~p1~0; {62#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:34,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {62#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {58#false} is VALID [2022-04-08 08:17:34,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {58#false} assume !false; {58#false} is VALID [2022-04-08 08:17:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:34,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:34,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011846876] [2022-04-08 08:17:34,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011846876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:34,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:34,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:34,907 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:34,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1535903633] [2022-04-08 08:17:34,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1535903633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:34,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:34,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:34,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407021012] [2022-04-08 08:17:34,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:34,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:17:34,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:34,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:34,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:34,953 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:34,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:34,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:34,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:34,981 INFO L87 Difference]: Start difference. First operand has 54 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 49 states have internal predecessors, (91), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:35,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:35,403 INFO L93 Difference]: Finished difference Result 106 states and 187 transitions. [2022-04-08 08:17:35,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:35,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:17:35,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:35,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-08 08:17:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-08 08:17:35,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 187 transitions. [2022-04-08 08:17:35,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:35,633 INFO L225 Difference]: With dead ends: 106 [2022-04-08 08:17:35,633 INFO L226 Difference]: Without dead ends: 91 [2022-04-08 08:17:35,635 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:35,639 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 225 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:35,641 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 107 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:17:35,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-08 08:17:35,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 63. [2022-04-08 08:17:35,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:35,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:35,703 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:35,705 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:35,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:35,713 INFO L93 Difference]: Finished difference Result 91 states and 165 transitions. [2022-04-08 08:17:35,713 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 165 transitions. [2022-04-08 08:17:35,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:35,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:35,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-08 08:17:35,715 INFO L87 Difference]: Start difference. First operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-08 08:17:35,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:35,723 INFO L93 Difference]: Finished difference Result 91 states and 165 transitions. [2022-04-08 08:17:35,723 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 165 transitions. [2022-04-08 08:17:35,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:35,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:35,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:35,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 114 transitions. [2022-04-08 08:17:35,732 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 114 transitions. Word has length 24 [2022-04-08 08:17:35,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:35,732 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 114 transitions. [2022-04-08 08:17:35,733 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:35,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 114 transitions. [2022-04-08 08:17:35,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:35,852 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 114 transitions. [2022-04-08 08:17:35,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 08:17:35,853 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:35,853 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:35,854 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:17:35,854 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:35,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:35,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1522316171, now seen corresponding path program 1 times [2022-04-08 08:17:35,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:35,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1627216979] [2022-04-08 08:17:35,856 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:35,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1522316171, now seen corresponding path program 2 times [2022-04-08 08:17:35,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:35,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188684172] [2022-04-08 08:17:35,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:35,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:35,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:35,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {595#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {589#true} is VALID [2022-04-08 08:17:35,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {589#true} assume true; {589#true} is VALID [2022-04-08 08:17:35,965 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {589#true} {589#true} #251#return; {589#true} is VALID [2022-04-08 08:17:35,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {589#true} call ULTIMATE.init(); {595#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:35,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {595#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {589#true} is VALID [2022-04-08 08:17:35,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {589#true} assume true; {589#true} is VALID [2022-04-08 08:17:35,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {589#true} {589#true} #251#return; {589#true} is VALID [2022-04-08 08:17:35,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {589#true} call #t~ret18 := main(); {589#true} is VALID [2022-04-08 08:17:35,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {589#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {589#true} is VALID [2022-04-08 08:17:35,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {589#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {589#true} is VALID [2022-04-08 08:17:35,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {589#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {589#true} is VALID [2022-04-08 08:17:35,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {589#true} assume !(0 != ~p1~0); {594#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:35,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {594#(= main_~p1~0 0)} assume !(0 != ~p2~0); {594#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:35,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:35,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:35,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:35,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:35,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:35,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:35,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:35,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {594#(= main_~p1~0 0)} assume !(0 != ~p10~0); {594#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:35,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:35,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:35,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {594#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:35,974 INFO L290 TraceCheckUtils]: 21: Hoare triple {594#(= main_~p1~0 0)} assume 0 != ~p1~0; {590#false} is VALID [2022-04-08 08:17:35,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {590#false} assume 1 != ~lk1~0; {590#false} is VALID [2022-04-08 08:17:35,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {590#false} assume !false; {590#false} is VALID [2022-04-08 08:17:35,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:35,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:35,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188684172] [2022-04-08 08:17:35,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188684172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:35,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:35,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:35,976 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:35,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1627216979] [2022-04-08 08:17:35,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1627216979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:35,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:35,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:35,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218852217] [2022-04-08 08:17:35,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:35,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:17:35,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:35,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:35,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:35,999 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:35,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:36,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:36,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:36,000 INFO L87 Difference]: Start difference. First operand 63 states and 114 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:36,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:36,265 INFO L93 Difference]: Finished difference Result 148 states and 273 transitions. [2022-04-08 08:17:36,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:36,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:17:36,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2022-04-08 08:17:36,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:36,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2022-04-08 08:17:36,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 246 transitions. [2022-04-08 08:17:36,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:36,504 INFO L225 Difference]: With dead ends: 148 [2022-04-08 08:17:36,504 INFO L226 Difference]: Without dead ends: 91 [2022-04-08 08:17:36,505 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:36,506 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 193 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:36,507 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 119 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:17:36,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-08 08:17:36,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2022-04-08 08:17:36,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:36,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:36,522 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:36,522 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:36,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:36,529 INFO L93 Difference]: Finished difference Result 91 states and 163 transitions. [2022-04-08 08:17:36,530 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2022-04-08 08:17:36,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:36,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:36,534 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-08 08:17:36,534 INFO L87 Difference]: Start difference. First operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-08 08:17:36,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:36,541 INFO L93 Difference]: Finished difference Result 91 states and 163 transitions. [2022-04-08 08:17:36,541 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2022-04-08 08:17:36,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:36,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:36,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:36,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:36,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 162 transitions. [2022-04-08 08:17:36,545 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 162 transitions. Word has length 24 [2022-04-08 08:17:36,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:36,545 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 162 transitions. [2022-04-08 08:17:36,546 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:36,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 162 transitions. [2022-04-08 08:17:36,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:36,705 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 162 transitions. [2022-04-08 08:17:36,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 08:17:36,705 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:36,705 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:36,706 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:17:36,713 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:36,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:36,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1535721358, now seen corresponding path program 1 times [2022-04-08 08:17:36,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:36,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2098392952] [2022-04-08 08:17:36,721 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:36,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1535721358, now seen corresponding path program 2 times [2022-04-08 08:17:36,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:36,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764492022] [2022-04-08 08:17:36,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:36,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:36,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:36,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {1263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1257#true} is VALID [2022-04-08 08:17:36,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {1257#true} assume true; {1257#true} is VALID [2022-04-08 08:17:36,815 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1257#true} {1257#true} #251#return; {1257#true} is VALID [2022-04-08 08:17:36,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {1257#true} call ULTIMATE.init(); {1263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:36,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {1263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1257#true} is VALID [2022-04-08 08:17:36,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {1257#true} assume true; {1257#true} is VALID [2022-04-08 08:17:36,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1257#true} {1257#true} #251#return; {1257#true} is VALID [2022-04-08 08:17:36,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {1257#true} call #t~ret18 := main(); {1257#true} is VALID [2022-04-08 08:17:36,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {1257#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {1257#true} is VALID [2022-04-08 08:17:36,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {1257#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {1257#true} is VALID [2022-04-08 08:17:36,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {1257#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {1257#true} is VALID [2022-04-08 08:17:36,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {1257#true} assume 0 != ~p1~0;~lk1~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:36,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {1262#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1262#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:36,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:36,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:36,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:36,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:36,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:36,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:36,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:36,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {1262#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1262#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:36,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:36,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:36,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {1262#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {1262#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:36,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {1262#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1258#false} is VALID [2022-04-08 08:17:36,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {1258#false} assume 0 != ~p2~0; {1258#false} is VALID [2022-04-08 08:17:36,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {1258#false} assume 1 != ~lk2~0; {1258#false} is VALID [2022-04-08 08:17:36,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {1258#false} assume !false; {1258#false} is VALID [2022-04-08 08:17:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:36,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:36,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764492022] [2022-04-08 08:17:36,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764492022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:36,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:36,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:36,826 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:36,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2098392952] [2022-04-08 08:17:36,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2098392952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:36,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:36,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:36,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091592586] [2022-04-08 08:17:36,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:36,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 08:17:36,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:36,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:36,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:36,845 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:36,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:36,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:36,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:36,846 INFO L87 Difference]: Start difference. First operand 89 states and 162 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:37,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:37,087 INFO L93 Difference]: Finished difference Result 136 states and 244 transitions. [2022-04-08 08:17:37,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:37,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 08:17:37,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:37,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:37,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2022-04-08 08:17:37,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2022-04-08 08:17:37,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 241 transitions. [2022-04-08 08:17:37,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:37,283 INFO L225 Difference]: With dead ends: 136 [2022-04-08 08:17:37,283 INFO L226 Difference]: Without dead ends: 94 [2022-04-08 08:17:37,283 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:37,284 INFO L913 BasicCegarLoop]: 136 mSDtfsCounter, 170 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:37,285 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 143 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:17:37,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-08 08:17:37,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2022-04-08 08:17:37,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:37,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:37,298 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:37,298 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:37,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:37,301 INFO L93 Difference]: Finished difference Result 94 states and 165 transitions. [2022-04-08 08:17:37,301 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 165 transitions. [2022-04-08 08:17:37,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:37,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:37,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-08 08:17:37,303 INFO L87 Difference]: Start difference. First operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-08 08:17:37,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:37,306 INFO L93 Difference]: Finished difference Result 94 states and 165 transitions. [2022-04-08 08:17:37,306 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 165 transitions. [2022-04-08 08:17:37,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:37,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:37,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:37,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:37,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:37,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 164 transitions. [2022-04-08 08:17:37,309 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 164 transitions. Word has length 25 [2022-04-08 08:17:37,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:37,310 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 164 transitions. [2022-04-08 08:17:37,310 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:37,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 164 transitions. [2022-04-08 08:17:37,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:37,496 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2022-04-08 08:17:37,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 08:17:37,496 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:37,496 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:37,496 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:17:37,497 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:37,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:37,497 INFO L85 PathProgramCache]: Analyzing trace with hash -52626544, now seen corresponding path program 1 times [2022-04-08 08:17:37,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:37,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [458976018] [2022-04-08 08:17:37,498 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:37,498 INFO L85 PathProgramCache]: Analyzing trace with hash -52626544, now seen corresponding path program 2 times [2022-04-08 08:17:37,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:37,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205372918] [2022-04-08 08:17:37,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:37,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:37,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:37,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {1919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1913#true} is VALID [2022-04-08 08:17:37,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {1913#true} assume true; {1913#true} is VALID [2022-04-08 08:17:37,544 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1913#true} {1913#true} #251#return; {1913#true} is VALID [2022-04-08 08:17:37,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {1913#true} call ULTIMATE.init(); {1919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:37,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {1919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1913#true} is VALID [2022-04-08 08:17:37,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {1913#true} assume true; {1913#true} is VALID [2022-04-08 08:17:37,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1913#true} {1913#true} #251#return; {1913#true} is VALID [2022-04-08 08:17:37,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {1913#true} call #t~ret18 := main(); {1913#true} is VALID [2022-04-08 08:17:37,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {1913#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {1913#true} is VALID [2022-04-08 08:17:37,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {1913#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {1913#true} is VALID [2022-04-08 08:17:37,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {1913#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {1913#true} is VALID [2022-04-08 08:17:37,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {1913#true} assume !(0 != ~p1~0); {1913#true} is VALID [2022-04-08 08:17:37,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {1913#true} assume !(0 != ~p2~0); {1918#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:37,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:37,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:37,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:37,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:37,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:37,551 INFO L290 TraceCheckUtils]: 15: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:37,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:37,552 INFO L290 TraceCheckUtils]: 17: Hoare triple {1918#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1918#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:37,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:37,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:37,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {1918#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:37,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {1918#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1918#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:37,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {1918#(= main_~p2~0 0)} assume 0 != ~p2~0; {1914#false} is VALID [2022-04-08 08:17:37,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {1914#false} assume 1 != ~lk2~0; {1914#false} is VALID [2022-04-08 08:17:37,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {1914#false} assume !false; {1914#false} is VALID [2022-04-08 08:17:37,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:37,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:37,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205372918] [2022-04-08 08:17:37,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205372918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:37,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:37,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:37,557 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:37,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [458976018] [2022-04-08 08:17:37,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [458976018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:37,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:37,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:37,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175812309] [2022-04-08 08:17:37,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:37,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 08:17:37,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:37,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:37,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:37,575 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:37,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:37,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:37,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:37,576 INFO L87 Difference]: Start difference. First operand 92 states and 164 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:37,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:37,818 INFO L93 Difference]: Finished difference Result 256 states and 468 transitions. [2022-04-08 08:17:37,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:37,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 08:17:37,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:37,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:37,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2022-04-08 08:17:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:37,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2022-04-08 08:17:37,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 244 transitions. [2022-04-08 08:17:38,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:38,018 INFO L225 Difference]: With dead ends: 256 [2022-04-08 08:17:38,018 INFO L226 Difference]: Without dead ends: 173 [2022-04-08 08:17:38,019 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:38,020 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 214 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:38,020 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 97 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:17:38,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-08 08:17:38,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2022-04-08 08:17:38,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:38,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,039 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,040 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:38,045 INFO L93 Difference]: Finished difference Result 173 states and 310 transitions. [2022-04-08 08:17:38,045 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 310 transitions. [2022-04-08 08:17:38,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:38,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:38,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states. [2022-04-08 08:17:38,047 INFO L87 Difference]: Start difference. First operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states. [2022-04-08 08:17:38,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:38,052 INFO L93 Difference]: Finished difference Result 173 states and 310 transitions. [2022-04-08 08:17:38,052 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 310 transitions. [2022-04-08 08:17:38,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:38,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:38,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:38,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:38,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 309 transitions. [2022-04-08 08:17:38,058 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 309 transitions. Word has length 25 [2022-04-08 08:17:38,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:38,059 INFO L478 AbstractCegarLoop]: Abstraction has 171 states and 309 transitions. [2022-04-08 08:17:38,059 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 309 transitions. [2022-04-08 08:17:38,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 309 edges. 309 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:38,373 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 309 transitions. [2022-04-08 08:17:38,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 08:17:38,374 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:38,374 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:38,374 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:17:38,374 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:38,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:38,375 INFO L85 PathProgramCache]: Analyzing trace with hash 968441810, now seen corresponding path program 1 times [2022-04-08 08:17:38,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:38,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [664341451] [2022-04-08 08:17:38,375 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:38,375 INFO L85 PathProgramCache]: Analyzing trace with hash 968441810, now seen corresponding path program 2 times [2022-04-08 08:17:38,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:38,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516565013] [2022-04-08 08:17:38,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:38,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:38,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:38,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {3131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3125#true} is VALID [2022-04-08 08:17:38,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {3125#true} assume true; {3125#true} is VALID [2022-04-08 08:17:38,420 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3125#true} {3125#true} #251#return; {3125#true} is VALID [2022-04-08 08:17:38,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {3125#true} call ULTIMATE.init(); {3131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:38,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {3131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3125#true} is VALID [2022-04-08 08:17:38,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {3125#true} assume true; {3125#true} is VALID [2022-04-08 08:17:38,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3125#true} {3125#true} #251#return; {3125#true} is VALID [2022-04-08 08:17:38,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {3125#true} call #t~ret18 := main(); {3125#true} is VALID [2022-04-08 08:17:38,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {3125#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {3125#true} is VALID [2022-04-08 08:17:38,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {3125#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {3125#true} is VALID [2022-04-08 08:17:38,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {3125#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {3125#true} is VALID [2022-04-08 08:17:38,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {3125#true} assume !(0 != ~p1~0); {3125#true} is VALID [2022-04-08 08:17:38,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {3125#true} assume 0 != ~p2~0;~lk2~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:38,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:38,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:38,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:38,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:38,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:38,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:38,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:38,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {3130#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {3130#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:38,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:38,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:38,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {3130#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:38,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {3130#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {3130#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:38,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {3130#(= main_~lk2~0 1)} assume 0 != ~p2~0; {3130#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:38,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {3130#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {3126#false} is VALID [2022-04-08 08:17:38,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {3126#false} assume !false; {3126#false} is VALID [2022-04-08 08:17:38,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:38,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:38,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516565013] [2022-04-08 08:17:38,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516565013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:38,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:38,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:38,429 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:38,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [664341451] [2022-04-08 08:17:38,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [664341451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:38,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:38,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:38,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103204624] [2022-04-08 08:17:38,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:38,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 08:17:38,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:38,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:38,447 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:38,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:38,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:38,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:38,448 INFO L87 Difference]: Start difference. First operand 171 states and 309 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:38,697 INFO L93 Difference]: Finished difference Result 223 states and 403 transitions. [2022-04-08 08:17:38,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:38,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 08:17:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:38,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2022-04-08 08:17:38,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2022-04-08 08:17:38,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 160 transitions. [2022-04-08 08:17:38,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:38,829 INFO L225 Difference]: With dead ends: 223 [2022-04-08 08:17:38,829 INFO L226 Difference]: Without dead ends: 221 [2022-04-08 08:17:38,830 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:38,831 INFO L913 BasicCegarLoop]: 157 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:38,831 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 164 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:17:38,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-04-08 08:17:38,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 171. [2022-04-08 08:17:38,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:38,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,847 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,848 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:38,854 INFO L93 Difference]: Finished difference Result 221 states and 400 transitions. [2022-04-08 08:17:38,855 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 400 transitions. [2022-04-08 08:17:38,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:38,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:38,856 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 221 states. [2022-04-08 08:17:38,856 INFO L87 Difference]: Start difference. First operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 221 states. [2022-04-08 08:17:38,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:38,863 INFO L93 Difference]: Finished difference Result 221 states and 400 transitions. [2022-04-08 08:17:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 400 transitions. [2022-04-08 08:17:38,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:38,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:38,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:38,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:38,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 307 transitions. [2022-04-08 08:17:38,870 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 307 transitions. Word has length 25 [2022-04-08 08:17:38,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:38,871 INFO L478 AbstractCegarLoop]: Abstraction has 171 states and 307 transitions. [2022-04-08 08:17:38,871 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 307 transitions. [2022-04-08 08:17:39,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 307 edges. 307 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:39,151 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 307 transitions. [2022-04-08 08:17:39,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:17:39,151 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:39,152 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:39,152 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:17:39,152 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:39,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:39,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1631210112, now seen corresponding path program 1 times [2022-04-08 08:17:39,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:39,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1619488260] [2022-04-08 08:17:39,153 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:39,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1631210112, now seen corresponding path program 2 times [2022-04-08 08:17:39,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:39,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499683606] [2022-04-08 08:17:39,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:39,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:39,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:39,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {4373#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4367#true} is VALID [2022-04-08 08:17:39,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {4367#true} assume true; {4367#true} is VALID [2022-04-08 08:17:39,227 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4367#true} {4367#true} #251#return; {4367#true} is VALID [2022-04-08 08:17:39,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {4367#true} call ULTIMATE.init(); {4373#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:39,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {4373#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4367#true} is VALID [2022-04-08 08:17:39,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {4367#true} assume true; {4367#true} is VALID [2022-04-08 08:17:39,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4367#true} {4367#true} #251#return; {4367#true} is VALID [2022-04-08 08:17:39,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {4367#true} call #t~ret18 := main(); {4367#true} is VALID [2022-04-08 08:17:39,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {4367#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {4367#true} is VALID [2022-04-08 08:17:39,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {4367#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {4367#true} is VALID [2022-04-08 08:17:39,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {4367#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {4367#true} is VALID [2022-04-08 08:17:39,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {4367#true} assume !(0 != ~p1~0); {4367#true} is VALID [2022-04-08 08:17:39,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {4367#true} assume !(0 != ~p2~0); {4367#true} is VALID [2022-04-08 08:17:39,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {4367#true} assume 0 != ~p3~0;~lk3~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:39,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:39,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:39,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:39,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:39,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:39,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:39,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {4372#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {4372#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:39,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:39,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:39,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {4372#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:39,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {4372#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {4372#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:39,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {4372#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {4372#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:39,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {4372#(= main_~lk3~0 1)} assume 0 != ~p3~0; {4372#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:39,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {4372#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {4368#false} is VALID [2022-04-08 08:17:39,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {4368#false} assume !false; {4368#false} is VALID [2022-04-08 08:17:39,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:39,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:39,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499683606] [2022-04-08 08:17:39,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499683606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:39,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:39,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:39,236 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:39,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1619488260] [2022-04-08 08:17:39,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1619488260] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:39,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:39,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:39,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049530116] [2022-04-08 08:17:39,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:39,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 08:17:39,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:39,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:39,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:39,255 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:39,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:39,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:39,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:39,256 INFO L87 Difference]: Start difference. First operand 171 states and 307 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:39,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:39,527 INFO L93 Difference]: Finished difference Result 323 states and 587 transitions. [2022-04-08 08:17:39,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:39,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 08:17:39,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:39,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:39,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-08 08:17:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:39,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-08 08:17:39,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-08 08:17:39,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:39,680 INFO L225 Difference]: With dead ends: 323 [2022-04-08 08:17:39,680 INFO L226 Difference]: Without dead ends: 321 [2022-04-08 08:17:39,680 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:39,681 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 205 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:39,681 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 94 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:17:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-08 08:17:39,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 231. [2022-04-08 08:17:39,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:39,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:39,700 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:39,701 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:39,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:39,710 INFO L93 Difference]: Finished difference Result 321 states and 582 transitions. [2022-04-08 08:17:39,710 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 582 transitions. [2022-04-08 08:17:39,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:39,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:39,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-08 08:17:39,712 INFO L87 Difference]: Start difference. First operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-08 08:17:39,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:39,721 INFO L93 Difference]: Finished difference Result 321 states and 582 transitions. [2022-04-08 08:17:39,721 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 582 transitions. [2022-04-08 08:17:39,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:39,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:39,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:39,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:39,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:39,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 413 transitions. [2022-04-08 08:17:39,729 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 413 transitions. Word has length 26 [2022-04-08 08:17:39,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:39,729 INFO L478 AbstractCegarLoop]: Abstraction has 231 states and 413 transitions. [2022-04-08 08:17:39,729 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:39,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 231 states and 413 transitions. [2022-04-08 08:17:40,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 413 edges. 413 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:40,136 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 413 transitions. [2022-04-08 08:17:40,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:17:40,137 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:40,137 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:40,137 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:17:40,137 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:40,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:40,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1642688830, now seen corresponding path program 1 times [2022-04-08 08:17:40,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:40,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1217895596] [2022-04-08 08:17:40,139 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:40,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1642688830, now seen corresponding path program 2 times [2022-04-08 08:17:40,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:40,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534467378] [2022-04-08 08:17:40,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:40,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:40,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:40,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {6135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {6129#true} is VALID [2022-04-08 08:17:40,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {6129#true} assume true; {6129#true} is VALID [2022-04-08 08:17:40,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6129#true} {6129#true} #251#return; {6129#true} is VALID [2022-04-08 08:17:40,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {6129#true} call ULTIMATE.init(); {6135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:40,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {6135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {6129#true} is VALID [2022-04-08 08:17:40,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {6129#true} assume true; {6129#true} is VALID [2022-04-08 08:17:40,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6129#true} {6129#true} #251#return; {6129#true} is VALID [2022-04-08 08:17:40,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {6129#true} call #t~ret18 := main(); {6129#true} is VALID [2022-04-08 08:17:40,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {6129#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {6129#true} is VALID [2022-04-08 08:17:40,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {6129#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {6129#true} is VALID [2022-04-08 08:17:40,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {6129#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {6129#true} is VALID [2022-04-08 08:17:40,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {6129#true} assume !(0 != ~p1~0); {6129#true} is VALID [2022-04-08 08:17:40,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {6129#true} assume !(0 != ~p2~0); {6129#true} is VALID [2022-04-08 08:17:40,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {6129#true} assume !(0 != ~p3~0); {6134#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:40,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:40,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:40,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:40,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:40,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:40,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:40,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {6134#(= main_~p3~0 0)} assume !(0 != ~p10~0); {6134#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:40,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:40,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:40,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {6134#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:40,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {6134#(= main_~p3~0 0)} assume !(0 != ~p1~0); {6134#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:40,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {6134#(= main_~p3~0 0)} assume !(0 != ~p2~0); {6134#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:40,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {6134#(= main_~p3~0 0)} assume 0 != ~p3~0; {6130#false} is VALID [2022-04-08 08:17:40,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {6130#false} assume 1 != ~lk3~0; {6130#false} is VALID [2022-04-08 08:17:40,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {6130#false} assume !false; {6130#false} is VALID [2022-04-08 08:17:40,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:40,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:40,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534467378] [2022-04-08 08:17:40,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534467378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:40,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:40,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:40,246 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:40,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1217895596] [2022-04-08 08:17:40,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1217895596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:40,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:40,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:40,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329102908] [2022-04-08 08:17:40,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:40,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 08:17:40,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:40,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:40,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:40,271 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:40,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:40,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:40,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:40,272 INFO L87 Difference]: Start difference. First operand 231 states and 413 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:40,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:40,543 INFO L93 Difference]: Finished difference Result 551 states and 995 transitions. [2022-04-08 08:17:40,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:40,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 08:17:40,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:40,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:40,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2022-04-08 08:17:40,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:40,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2022-04-08 08:17:40,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 240 transitions. [2022-04-08 08:17:40,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:40,729 INFO L225 Difference]: With dead ends: 551 [2022-04-08 08:17:40,729 INFO L226 Difference]: Without dead ends: 329 [2022-04-08 08:17:40,731 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:40,731 INFO L913 BasicCegarLoop]: 116 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:40,731 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 123 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:17:40,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-08 08:17:40,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2022-04-08 08:17:40,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:40,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:40,765 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:40,766 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:40,774 INFO L93 Difference]: Finished difference Result 329 states and 584 transitions. [2022-04-08 08:17:40,774 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 584 transitions. [2022-04-08 08:17:40,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:40,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:40,776 INFO L74 IsIncluded]: Start isIncluded. First operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-08 08:17:40,777 INFO L87 Difference]: Start difference. First operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-08 08:17:40,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:40,786 INFO L93 Difference]: Finished difference Result 329 states and 584 transitions. [2022-04-08 08:17:40,786 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 584 transitions. [2022-04-08 08:17:40,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:40,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:40,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:40,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:40,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:40,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 583 transitions. [2022-04-08 08:17:40,798 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 583 transitions. Word has length 26 [2022-04-08 08:17:40,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:40,798 INFO L478 AbstractCegarLoop]: Abstraction has 327 states and 583 transitions. [2022-04-08 08:17:40,798 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:40,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 327 states and 583 transitions. [2022-04-08 08:17:41,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:41,317 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 583 transitions. [2022-04-08 08:17:41,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 08:17:41,318 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:41,318 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:41,318 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:17:41,318 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:41,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:41,319 INFO L85 PathProgramCache]: Analyzing trace with hash 972307173, now seen corresponding path program 1 times [2022-04-08 08:17:41,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:41,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [911723573] [2022-04-08 08:17:41,319 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:41,319 INFO L85 PathProgramCache]: Analyzing trace with hash 972307173, now seen corresponding path program 2 times [2022-04-08 08:17:41,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:41,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861501482] [2022-04-08 08:17:41,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:41,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:41,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:41,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {8561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {8555#true} is VALID [2022-04-08 08:17:41,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {8555#true} assume true; {8555#true} is VALID [2022-04-08 08:17:41,402 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8555#true} {8555#true} #251#return; {8555#true} is VALID [2022-04-08 08:17:41,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {8555#true} call ULTIMATE.init(); {8561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:41,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {8561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {8555#true} is VALID [2022-04-08 08:17:41,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {8555#true} assume true; {8555#true} is VALID [2022-04-08 08:17:41,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8555#true} {8555#true} #251#return; {8555#true} is VALID [2022-04-08 08:17:41,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {8555#true} call #t~ret18 := main(); {8555#true} is VALID [2022-04-08 08:17:41,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {8555#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {8555#true} is VALID [2022-04-08 08:17:41,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {8555#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {8555#true} is VALID [2022-04-08 08:17:41,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {8555#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {8555#true} is VALID [2022-04-08 08:17:41,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {8555#true} assume !(0 != ~p1~0); {8555#true} is VALID [2022-04-08 08:17:41,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {8555#true} assume !(0 != ~p2~0); {8555#true} is VALID [2022-04-08 08:17:41,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {8555#true} assume 0 != ~p3~0;~lk3~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:41,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:41,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:41,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:41,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:41,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:41,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:41,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {8560#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {8560#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:41,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:41,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:41,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {8560#(not (= main_~p3~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {8560#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:41,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {8560#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {8560#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:41,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {8560#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {8560#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:41,413 INFO L290 TraceCheckUtils]: 23: Hoare triple {8560#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {8556#false} is VALID [2022-04-08 08:17:41,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {8556#false} assume 0 != ~p4~0; {8556#false} is VALID [2022-04-08 08:17:41,419 INFO L290 TraceCheckUtils]: 25: Hoare triple {8556#false} assume 1 != ~lk4~0; {8556#false} is VALID [2022-04-08 08:17:41,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {8556#false} assume !false; {8556#false} is VALID [2022-04-08 08:17:41,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:41,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:41,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861501482] [2022-04-08 08:17:41,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861501482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:41,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:41,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:41,420 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:41,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [911723573] [2022-04-08 08:17:41,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [911723573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:41,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:41,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:41,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50549038] [2022-04-08 08:17:41,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:41,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 08:17:41,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:41,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:41,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:41,440 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:41,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:41,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:41,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:41,441 INFO L87 Difference]: Start difference. First operand 327 states and 583 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:41,660 INFO L93 Difference]: Finished difference Result 493 states and 877 transitions. [2022-04-08 08:17:41,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:41,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 08:17:41,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:41,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:41,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions. [2022-04-08 08:17:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions. [2022-04-08 08:17:41,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 235 transitions. [2022-04-08 08:17:41,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:41,829 INFO L225 Difference]: With dead ends: 493 [2022-04-08 08:17:41,829 INFO L226 Difference]: Without dead ends: 335 [2022-04-08 08:17:41,830 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:41,831 INFO L913 BasicCegarLoop]: 130 mSDtfsCounter, 168 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:41,831 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 137 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:17:41,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-04-08 08:17:41,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2022-04-08 08:17:41,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:41,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 335 states. Second operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:41,854 INFO L74 IsIncluded]: Start isIncluded. First operand 335 states. Second operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:41,855 INFO L87 Difference]: Start difference. First operand 335 states. Second operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:41,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:41,863 INFO L93 Difference]: Finished difference Result 335 states and 588 transitions. [2022-04-08 08:17:41,863 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 588 transitions. [2022-04-08 08:17:41,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:41,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:41,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 335 states. [2022-04-08 08:17:41,866 INFO L87 Difference]: Start difference. First operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 335 states. [2022-04-08 08:17:41,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:41,875 INFO L93 Difference]: Finished difference Result 335 states and 588 transitions. [2022-04-08 08:17:41,875 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 588 transitions. [2022-04-08 08:17:41,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:41,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:41,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:41,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:41,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:41,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 587 transitions. [2022-04-08 08:17:41,887 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 587 transitions. Word has length 27 [2022-04-08 08:17:41,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:41,887 INFO L478 AbstractCegarLoop]: Abstraction has 333 states and 587 transitions. [2022-04-08 08:17:41,888 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:41,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 333 states and 587 transitions. [2022-04-08 08:17:42,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 587 edges. 587 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:42,501 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 587 transitions. [2022-04-08 08:17:42,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 08:17:42,502 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:42,502 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:42,502 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:17:42,502 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:42,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:42,503 INFO L85 PathProgramCache]: Analyzing trace with hash -616040729, now seen corresponding path program 1 times [2022-04-08 08:17:42,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:42,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [225716858] [2022-04-08 08:17:42,503 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:42,503 INFO L85 PathProgramCache]: Analyzing trace with hash -616040729, now seen corresponding path program 2 times [2022-04-08 08:17:42,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:42,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208728445] [2022-04-08 08:17:42,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:42,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:42,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:42,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {10895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {10889#true} is VALID [2022-04-08 08:17:42,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {10889#true} assume true; {10889#true} is VALID [2022-04-08 08:17:42,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10889#true} {10889#true} #251#return; {10889#true} is VALID [2022-04-08 08:17:42,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {10889#true} call ULTIMATE.init(); {10895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:42,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {10895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {10889#true} is VALID [2022-04-08 08:17:42,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {10889#true} assume true; {10889#true} is VALID [2022-04-08 08:17:42,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10889#true} {10889#true} #251#return; {10889#true} is VALID [2022-04-08 08:17:42,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {10889#true} call #t~ret18 := main(); {10889#true} is VALID [2022-04-08 08:17:42,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {10889#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {10889#true} is VALID [2022-04-08 08:17:42,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {10889#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {10889#true} is VALID [2022-04-08 08:17:42,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {10889#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {10889#true} is VALID [2022-04-08 08:17:42,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {10889#true} assume !(0 != ~p1~0); {10889#true} is VALID [2022-04-08 08:17:42,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {10889#true} assume !(0 != ~p2~0); {10889#true} is VALID [2022-04-08 08:17:42,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {10889#true} assume !(0 != ~p3~0); {10889#true} is VALID [2022-04-08 08:17:42,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {10889#true} assume 0 != ~p4~0;~lk4~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:42,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:42,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:42,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:42,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:42,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:42,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {10894#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {10894#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:42,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:42,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:42,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {10894#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:42,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {10894#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {10894#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:42,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {10894#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {10894#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:42,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {10894#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {10894#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:42,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {10894#(= main_~lk4~0 1)} assume 0 != ~p4~0; {10894#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:42,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {10894#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {10890#false} is VALID [2022-04-08 08:17:42,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {10890#false} assume !false; {10890#false} is VALID [2022-04-08 08:17:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:42,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:42,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208728445] [2022-04-08 08:17:42,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208728445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:42,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:42,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:42,550 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:42,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [225716858] [2022-04-08 08:17:42,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [225716858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:42,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:42,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:42,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48547363] [2022-04-08 08:17:42,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:42,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 08:17:42,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:42,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:42,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:42,570 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:42,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:42,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:42,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:42,570 INFO L87 Difference]: Start difference. First operand 333 states and 587 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:42,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:42,839 INFO L93 Difference]: Finished difference Result 621 states and 1109 transitions. [2022-04-08 08:17:42,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:42,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 08:17:42,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:42,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:42,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-08 08:17:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:42,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-08 08:17:42,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 155 transitions. [2022-04-08 08:17:42,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:42,991 INFO L225 Difference]: With dead ends: 621 [2022-04-08 08:17:42,991 INFO L226 Difference]: Without dead ends: 619 [2022-04-08 08:17:42,992 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:42,992 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 198 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:42,992 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 93 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:17:42,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-04-08 08:17:43,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 457. [2022-04-08 08:17:43,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:43,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 619 states. Second operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:43,027 INFO L74 IsIncluded]: Start isIncluded. First operand 619 states. Second operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:43,028 INFO L87 Difference]: Start difference. First operand 619 states. Second operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:43,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:43,051 INFO L93 Difference]: Finished difference Result 619 states and 1100 transitions. [2022-04-08 08:17:43,051 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 1100 transitions. [2022-04-08 08:17:43,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:43,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:43,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states. [2022-04-08 08:17:43,055 INFO L87 Difference]: Start difference. First operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states. [2022-04-08 08:17:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:43,079 INFO L93 Difference]: Finished difference Result 619 states and 1100 transitions. [2022-04-08 08:17:43,079 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 1100 transitions. [2022-04-08 08:17:43,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:43,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:43,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:43,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:43,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:43,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 795 transitions. [2022-04-08 08:17:43,124 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 795 transitions. Word has length 27 [2022-04-08 08:17:43,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:43,124 INFO L478 AbstractCegarLoop]: Abstraction has 457 states and 795 transitions. [2022-04-08 08:17:43,124 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:43,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 457 states and 795 transitions. [2022-04-08 08:17:43,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 795 edges. 795 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:43,930 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 795 transitions. [2022-04-08 08:17:43,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 08:17:43,934 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:43,934 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:43,934 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:17:43,934 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:43,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:43,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1637109083, now seen corresponding path program 1 times [2022-04-08 08:17:43,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:43,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [487212063] [2022-04-08 08:17:43,936 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:43,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1637109083, now seen corresponding path program 2 times [2022-04-08 08:17:43,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:43,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94147856] [2022-04-08 08:17:43,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:43,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:43,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:44,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {14301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {14295#true} is VALID [2022-04-08 08:17:44,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 08:17:44,003 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14295#true} {14295#true} #251#return; {14295#true} is VALID [2022-04-08 08:17:44,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {14295#true} call ULTIMATE.init(); {14301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:44,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {14301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {14295#true} is VALID [2022-04-08 08:17:44,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 08:17:44,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14295#true} {14295#true} #251#return; {14295#true} is VALID [2022-04-08 08:17:44,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {14295#true} call #t~ret18 := main(); {14295#true} is VALID [2022-04-08 08:17:44,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {14295#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {14295#true} is VALID [2022-04-08 08:17:44,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {14295#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {14295#true} is VALID [2022-04-08 08:17:44,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {14295#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {14295#true} is VALID [2022-04-08 08:17:44,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {14295#true} assume !(0 != ~p1~0); {14295#true} is VALID [2022-04-08 08:17:44,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {14295#true} assume !(0 != ~p2~0); {14295#true} is VALID [2022-04-08 08:17:44,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {14295#true} assume !(0 != ~p3~0); {14295#true} is VALID [2022-04-08 08:17:44,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {14295#true} assume !(0 != ~p4~0); {14300#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:44,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:44,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:44,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:44,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:44,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:44,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {14300#(= main_~p4~0 0)} assume !(0 != ~p10~0); {14300#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:44,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:44,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:44,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {14300#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:44,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {14300#(= main_~p4~0 0)} assume !(0 != ~p1~0); {14300#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:44,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {14300#(= main_~p4~0 0)} assume !(0 != ~p2~0); {14300#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:44,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {14300#(= main_~p4~0 0)} assume !(0 != ~p3~0); {14300#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:44,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {14300#(= main_~p4~0 0)} assume 0 != ~p4~0; {14296#false} is VALID [2022-04-08 08:17:44,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {14296#false} assume 1 != ~lk4~0; {14296#false} is VALID [2022-04-08 08:17:44,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {14296#false} assume !false; {14296#false} is VALID [2022-04-08 08:17:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:44,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:44,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94147856] [2022-04-08 08:17:44,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94147856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:44,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:44,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:44,011 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:44,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [487212063] [2022-04-08 08:17:44,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [487212063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:44,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:44,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:44,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830880549] [2022-04-08 08:17:44,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:44,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 08:17:44,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:44,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:44,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:44,031 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:44,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:44,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:44,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:44,032 INFO L87 Difference]: Start difference. First operand 457 states and 795 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:44,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:44,389 INFO L93 Difference]: Finished difference Result 1085 states and 1901 transitions. [2022-04-08 08:17:44,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:44,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 08:17:44,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:44,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:44,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2022-04-08 08:17:44,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:44,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2022-04-08 08:17:44,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 237 transitions. [2022-04-08 08:17:44,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:44,606 INFO L225 Difference]: With dead ends: 1085 [2022-04-08 08:17:44,606 INFO L226 Difference]: Without dead ends: 643 [2022-04-08 08:17:44,607 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:44,608 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 175 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:44,608 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 125 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:17:44,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-04-08 08:17:44,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 641. [2022-04-08 08:17:44,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:44,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 643 states. Second operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:44,659 INFO L74 IsIncluded]: Start isIncluded. First operand 643 states. Second operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:44,660 INFO L87 Difference]: Start difference. First operand 643 states. Second operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:44,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:44,683 INFO L93 Difference]: Finished difference Result 643 states and 1112 transitions. [2022-04-08 08:17:44,683 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1112 transitions. [2022-04-08 08:17:44,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:44,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:44,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 643 states. [2022-04-08 08:17:44,686 INFO L87 Difference]: Start difference. First operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 643 states. [2022-04-08 08:17:44,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:44,710 INFO L93 Difference]: Finished difference Result 643 states and 1112 transitions. [2022-04-08 08:17:44,710 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1112 transitions. [2022-04-08 08:17:44,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:44,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:44,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:44,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:44,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1111 transitions. [2022-04-08 08:17:44,768 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1111 transitions. Word has length 27 [2022-04-08 08:17:44,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:44,768 INFO L478 AbstractCegarLoop]: Abstraction has 641 states and 1111 transitions. [2022-04-08 08:17:44,768 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:44,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 641 states and 1111 transitions. [2022-04-08 08:17:45,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1111 edges. 1111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:45,907 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1111 transitions. [2022-04-08 08:17:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 08:17:45,908 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:45,908 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:45,908 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 08:17:45,908 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:45,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:45,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1917179981, now seen corresponding path program 1 times [2022-04-08 08:17:45,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:45,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [637172751] [2022-04-08 08:17:45,909 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:45,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1917179981, now seen corresponding path program 2 times [2022-04-08 08:17:45,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:45,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834387430] [2022-04-08 08:17:45,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:45,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:45,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:45,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {19051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {19045#true} is VALID [2022-04-08 08:17:45,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {19045#true} assume true; {19045#true} is VALID [2022-04-08 08:17:45,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19045#true} {19045#true} #251#return; {19045#true} is VALID [2022-04-08 08:17:45,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {19045#true} call ULTIMATE.init(); {19051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:45,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {19051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {19045#true} is VALID [2022-04-08 08:17:45,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {19045#true} assume true; {19045#true} is VALID [2022-04-08 08:17:45,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19045#true} {19045#true} #251#return; {19045#true} is VALID [2022-04-08 08:17:45,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {19045#true} call #t~ret18 := main(); {19045#true} is VALID [2022-04-08 08:17:45,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {19045#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {19045#true} is VALID [2022-04-08 08:17:45,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {19045#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {19045#true} is VALID [2022-04-08 08:17:45,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {19045#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {19045#true} is VALID [2022-04-08 08:17:45,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {19045#true} assume !(0 != ~p1~0); {19045#true} is VALID [2022-04-08 08:17:45,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {19045#true} assume !(0 != ~p2~0); {19045#true} is VALID [2022-04-08 08:17:45,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {19045#true} assume !(0 != ~p3~0); {19045#true} is VALID [2022-04-08 08:17:45,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {19045#true} assume 0 != ~p4~0;~lk4~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:45,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:45,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:45,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:45,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:45,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:45,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {19050#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:45,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:45,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:45,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {19050#(not (= main_~p4~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {19050#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:45,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {19050#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:45,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {19050#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:45,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {19050#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:45,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {19050#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {19046#false} is VALID [2022-04-08 08:17:45,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {19046#false} assume 0 != ~p5~0; {19046#false} is VALID [2022-04-08 08:17:45,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {19046#false} assume 1 != ~lk5~0; {19046#false} is VALID [2022-04-08 08:17:45,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {19046#false} assume !false; {19046#false} is VALID [2022-04-08 08:17:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:45,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:45,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834387430] [2022-04-08 08:17:45,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834387430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:45,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:45,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:45,986 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:45,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [637172751] [2022-04-08 08:17:45,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [637172751] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:45,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:45,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:45,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114470995] [2022-04-08 08:17:45,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:45,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 08:17:45,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:45,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:46,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:46,008 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:46,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:46,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:46,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:46,009 INFO L87 Difference]: Start difference. First operand 641 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:46,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:46,315 INFO L93 Difference]: Finished difference Result 961 states and 1661 transitions. [2022-04-08 08:17:46,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:46,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 08:17:46,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:46,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2022-04-08 08:17:46,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:46,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2022-04-08 08:17:46,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 232 transitions. [2022-04-08 08:17:46,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 232 edges. 232 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:46,530 INFO L225 Difference]: With dead ends: 961 [2022-04-08 08:17:46,530 INFO L226 Difference]: Without dead ends: 651 [2022-04-08 08:17:46,531 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:46,531 INFO L913 BasicCegarLoop]: 127 mSDtfsCounter, 167 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:46,531 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 134 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:17:46,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-04-08 08:17:46,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 649. [2022-04-08 08:17:46,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:46,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 651 states. Second operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:46,611 INFO L74 IsIncluded]: Start isIncluded. First operand 651 states. Second operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:46,612 INFO L87 Difference]: Start difference. First operand 651 states. Second operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:46,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:46,638 INFO L93 Difference]: Finished difference Result 651 states and 1112 transitions. [2022-04-08 08:17:46,638 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1112 transitions. [2022-04-08 08:17:46,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:46,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:46,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 651 states. [2022-04-08 08:17:46,641 INFO L87 Difference]: Start difference. First operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 651 states. [2022-04-08 08:17:46,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:46,665 INFO L93 Difference]: Finished difference Result 651 states and 1112 transitions. [2022-04-08 08:17:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1112 transitions. [2022-04-08 08:17:46,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:46,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:46,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:46,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1111 transitions. [2022-04-08 08:17:46,702 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1111 transitions. Word has length 28 [2022-04-08 08:17:46,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:46,703 INFO L478 AbstractCegarLoop]: Abstraction has 649 states and 1111 transitions. [2022-04-08 08:17:46,703 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:46,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 649 states and 1111 transitions. [2022-04-08 08:17:47,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1111 edges. 1111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1111 transitions. [2022-04-08 08:17:47,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 08:17:47,773 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:47,774 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:47,774 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 08:17:47,774 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:47,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:47,774 INFO L85 PathProgramCache]: Analyzing trace with hash 789439413, now seen corresponding path program 1 times [2022-04-08 08:17:47,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:47,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1138758115] [2022-04-08 08:17:47,775 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:47,775 INFO L85 PathProgramCache]: Analyzing trace with hash 789439413, now seen corresponding path program 2 times [2022-04-08 08:17:47,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:47,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283492773] [2022-04-08 08:17:47,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:47,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:47,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:47,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {23585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {23579#true} is VALID [2022-04-08 08:17:47,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {23579#true} assume true; {23579#true} is VALID [2022-04-08 08:17:47,809 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23579#true} {23579#true} #251#return; {23579#true} is VALID [2022-04-08 08:17:47,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {23579#true} call ULTIMATE.init(); {23585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:47,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {23585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {23579#true} is VALID [2022-04-08 08:17:47,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {23579#true} assume true; {23579#true} is VALID [2022-04-08 08:17:47,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23579#true} {23579#true} #251#return; {23579#true} is VALID [2022-04-08 08:17:47,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {23579#true} call #t~ret18 := main(); {23579#true} is VALID [2022-04-08 08:17:47,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {23579#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {23579#true} is VALID [2022-04-08 08:17:47,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {23579#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {23579#true} is VALID [2022-04-08 08:17:47,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {23579#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {23579#true} is VALID [2022-04-08 08:17:47,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {23579#true} assume !(0 != ~p1~0); {23579#true} is VALID [2022-04-08 08:17:47,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {23579#true} assume !(0 != ~p2~0); {23579#true} is VALID [2022-04-08 08:17:47,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {23579#true} assume !(0 != ~p3~0); {23579#true} is VALID [2022-04-08 08:17:47,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {23579#true} assume !(0 != ~p4~0); {23579#true} is VALID [2022-04-08 08:17:47,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {23579#true} assume 0 != ~p5~0;~lk5~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:47,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:47,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:47,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:47,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:47,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {23584#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:47,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:47,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:47,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {23584#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:47,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {23584#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:47,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {23584#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:47,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {23584#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:47,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {23584#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {23584#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:47,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {23584#(= main_~lk5~0 1)} assume 0 != ~p5~0; {23584#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:47,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {23584#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {23580#false} is VALID [2022-04-08 08:17:47,818 INFO L290 TraceCheckUtils]: 27: Hoare triple {23580#false} assume !false; {23580#false} is VALID [2022-04-08 08:17:47,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:47,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:47,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283492773] [2022-04-08 08:17:47,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283492773] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:47,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:47,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:47,819 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:47,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1138758115] [2022-04-08 08:17:47,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1138758115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:47,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:47,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:47,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788477964] [2022-04-08 08:17:47,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:47,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 08:17:47,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:47,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:47,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:47,836 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:47,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:47,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:47,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:47,837 INFO L87 Difference]: Start difference. First operand 649 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:48,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:48,196 INFO L93 Difference]: Finished difference Result 1197 states and 2081 transitions. [2022-04-08 08:17:48,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:48,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 08:17:48,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:48,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-08 08:17:48,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-08 08:17:48,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-08 08:17:48,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:48,437 INFO L225 Difference]: With dead ends: 1197 [2022-04-08 08:17:48,438 INFO L226 Difference]: Without dead ends: 1195 [2022-04-08 08:17:48,439 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:48,441 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 191 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:48,441 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 92 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:17:48,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2022-04-08 08:17:48,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 905. [2022-04-08 08:17:48,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:48,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1195 states. Second operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:48,518 INFO L74 IsIncluded]: Start isIncluded. First operand 1195 states. Second operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:48,520 INFO L87 Difference]: Start difference. First operand 1195 states. Second operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:48,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:48,605 INFO L93 Difference]: Finished difference Result 1195 states and 2064 transitions. [2022-04-08 08:17:48,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 2064 transitions. [2022-04-08 08:17:48,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:48,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:48,608 INFO L74 IsIncluded]: Start isIncluded. First operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1195 states. [2022-04-08 08:17:48,610 INFO L87 Difference]: Start difference. First operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1195 states. [2022-04-08 08:17:48,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:48,681 INFO L93 Difference]: Finished difference Result 1195 states and 2064 transitions. [2022-04-08 08:17:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 2064 transitions. [2022-04-08 08:17:48,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:48,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:48,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:48,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:48,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:48,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1519 transitions. [2022-04-08 08:17:48,752 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1519 transitions. Word has length 28 [2022-04-08 08:17:48,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:48,752 INFO L478 AbstractCegarLoop]: Abstraction has 905 states and 1519 transitions. [2022-04-08 08:17:48,752 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:48,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 905 states and 1519 transitions. [2022-04-08 08:17:50,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1519 edges. 1519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1519 transitions. [2022-04-08 08:17:50,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 08:17:50,219 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:50,219 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:50,219 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 08:17:50,219 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:50,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:50,220 INFO L85 PathProgramCache]: Analyzing trace with hash -231628941, now seen corresponding path program 1 times [2022-04-08 08:17:50,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:50,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1966528828] [2022-04-08 08:17:50,220 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:50,220 INFO L85 PathProgramCache]: Analyzing trace with hash -231628941, now seen corresponding path program 2 times [2022-04-08 08:17:50,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:50,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062997851] [2022-04-08 08:17:50,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:50,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:50,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:50,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {30191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {30185#true} is VALID [2022-04-08 08:17:50,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {30185#true} assume true; {30185#true} is VALID [2022-04-08 08:17:50,269 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30185#true} {30185#true} #251#return; {30185#true} is VALID [2022-04-08 08:17:50,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {30185#true} call ULTIMATE.init(); {30191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:50,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {30191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {30185#true} is VALID [2022-04-08 08:17:50,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {30185#true} assume true; {30185#true} is VALID [2022-04-08 08:17:50,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30185#true} {30185#true} #251#return; {30185#true} is VALID [2022-04-08 08:17:50,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {30185#true} call #t~ret18 := main(); {30185#true} is VALID [2022-04-08 08:17:50,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {30185#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {30185#true} is VALID [2022-04-08 08:17:50,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {30185#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {30185#true} is VALID [2022-04-08 08:17:50,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {30185#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {30185#true} is VALID [2022-04-08 08:17:50,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {30185#true} assume !(0 != ~p1~0); {30185#true} is VALID [2022-04-08 08:17:50,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {30185#true} assume !(0 != ~p2~0); {30185#true} is VALID [2022-04-08 08:17:50,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {30185#true} assume !(0 != ~p3~0); {30185#true} is VALID [2022-04-08 08:17:50,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {30185#true} assume !(0 != ~p4~0); {30185#true} is VALID [2022-04-08 08:17:50,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {30185#true} assume !(0 != ~p5~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:50,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:50,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:50,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:50,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:50,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p10~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:50,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:50,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:50,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {30190#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:50,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p1~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:50,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p2~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:50,275 INFO L290 TraceCheckUtils]: 23: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p3~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:50,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {30190#(= main_~p5~0 0)} assume !(0 != ~p4~0); {30190#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:50,276 INFO L290 TraceCheckUtils]: 25: Hoare triple {30190#(= main_~p5~0 0)} assume 0 != ~p5~0; {30186#false} is VALID [2022-04-08 08:17:50,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {30186#false} assume 1 != ~lk5~0; {30186#false} is VALID [2022-04-08 08:17:50,276 INFO L290 TraceCheckUtils]: 27: Hoare triple {30186#false} assume !false; {30186#false} is VALID [2022-04-08 08:17:50,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:50,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:50,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062997851] [2022-04-08 08:17:50,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062997851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:50,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:50,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:50,277 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:50,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1966528828] [2022-04-08 08:17:50,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1966528828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:50,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:50,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:50,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099389194] [2022-04-08 08:17:50,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:50,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 08:17:50,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:50,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:50,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:50,294 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:50,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:50,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:50,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:50,295 INFO L87 Difference]: Start difference. First operand 905 states and 1519 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:50,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:50,947 INFO L93 Difference]: Finished difference Result 2141 states and 3617 transitions. [2022-04-08 08:17:50,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:50,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 08:17:50,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:50,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:50,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 234 transitions. [2022-04-08 08:17:50,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 234 transitions. [2022-04-08 08:17:50,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 234 transitions. [2022-04-08 08:17:51,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:51,191 INFO L225 Difference]: With dead ends: 2141 [2022-04-08 08:17:51,191 INFO L226 Difference]: Without dead ends: 1259 [2022-04-08 08:17:51,192 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:51,193 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 169 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:51,193 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 127 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:17:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2022-04-08 08:17:51,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1257. [2022-04-08 08:17:51,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:51,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1259 states. Second operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:51,327 INFO L74 IsIncluded]: Start isIncluded. First operand 1259 states. Second operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:51,329 INFO L87 Difference]: Start difference. First operand 1259 states. Second operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:51,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:51,407 INFO L93 Difference]: Finished difference Result 1259 states and 2104 transitions. [2022-04-08 08:17:51,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 2104 transitions. [2022-04-08 08:17:51,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:51,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:51,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1259 states. [2022-04-08 08:17:51,414 INFO L87 Difference]: Start difference. First operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1259 states. [2022-04-08 08:17:51,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:51,496 INFO L93 Difference]: Finished difference Result 1259 states and 2104 transitions. [2022-04-08 08:17:51,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 2104 transitions. [2022-04-08 08:17:51,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:51,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:51,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:51,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:51,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 2103 transitions. [2022-04-08 08:17:51,626 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 2103 transitions. Word has length 28 [2022-04-08 08:17:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:51,626 INFO L478 AbstractCegarLoop]: Abstraction has 1257 states and 2103 transitions. [2022-04-08 08:17:51,626 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:51,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1257 states and 2103 transitions. [2022-04-08 08:17:53,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2103 edges. 2103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:53,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 2103 transitions. [2022-04-08 08:17:53,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 08:17:53,676 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:53,676 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:53,676 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 08:17:53,676 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:53,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:53,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1296968198, now seen corresponding path program 1 times [2022-04-08 08:17:53,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:53,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1627918069] [2022-04-08 08:17:53,678 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:53,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1296968198, now seen corresponding path program 2 times [2022-04-08 08:17:53,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:53,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892165587] [2022-04-08 08:17:53,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:53,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:53,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:53,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {39517#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {39511#true} is VALID [2022-04-08 08:17:53,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {39511#true} assume true; {39511#true} is VALID [2022-04-08 08:17:53,735 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39511#true} {39511#true} #251#return; {39511#true} is VALID [2022-04-08 08:17:53,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {39511#true} call ULTIMATE.init(); {39517#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:53,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {39517#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {39511#true} is VALID [2022-04-08 08:17:53,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {39511#true} assume true; {39511#true} is VALID [2022-04-08 08:17:53,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39511#true} {39511#true} #251#return; {39511#true} is VALID [2022-04-08 08:17:53,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {39511#true} call #t~ret18 := main(); {39511#true} is VALID [2022-04-08 08:17:53,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {39511#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {39511#true} is VALID [2022-04-08 08:17:53,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {39511#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {39511#true} is VALID [2022-04-08 08:17:53,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {39511#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {39511#true} is VALID [2022-04-08 08:17:53,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {39511#true} assume !(0 != ~p1~0); {39511#true} is VALID [2022-04-08 08:17:53,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {39511#true} assume !(0 != ~p2~0); {39511#true} is VALID [2022-04-08 08:17:53,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {39511#true} assume !(0 != ~p3~0); {39511#true} is VALID [2022-04-08 08:17:53,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {39511#true} assume !(0 != ~p4~0); {39511#true} is VALID [2022-04-08 08:17:53,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {39511#true} assume 0 != ~p5~0;~lk5~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:53,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:53,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:53,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:53,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:53,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {39516#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:53,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:53,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:53,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {39516#(not (= main_~p5~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {39516#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:53,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {39516#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:53,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {39516#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:53,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {39516#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:53,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {39516#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:53,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {39516#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {39512#false} is VALID [2022-04-08 08:17:53,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {39512#false} assume 0 != ~p6~0; {39512#false} is VALID [2022-04-08 08:17:53,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {39512#false} assume 1 != ~lk6~0; {39512#false} is VALID [2022-04-08 08:17:53,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {39512#false} assume !false; {39512#false} is VALID [2022-04-08 08:17:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:53,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:53,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892165587] [2022-04-08 08:17:53,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892165587] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:53,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:53,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:53,749 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:53,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1627918069] [2022-04-08 08:17:53,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1627918069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:53,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:53,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:53,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707409641] [2022-04-08 08:17:53,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:53,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 08:17:53,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:53,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:53,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:53,767 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:53,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:53,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:53,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:53,768 INFO L87 Difference]: Start difference. First operand 1257 states and 2103 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:54,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:54,239 INFO L93 Difference]: Finished difference Result 1885 states and 3145 transitions. [2022-04-08 08:17:54,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:54,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 08:17:54,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:54,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 229 transitions. [2022-04-08 08:17:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 229 transitions. [2022-04-08 08:17:54,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 229 transitions. [2022-04-08 08:17:54,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 229 edges. 229 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:54,453 INFO L225 Difference]: With dead ends: 1885 [2022-04-08 08:17:54,453 INFO L226 Difference]: Without dead ends: 1275 [2022-04-08 08:17:54,454 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:54,454 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 166 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:54,454 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 131 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:17:54,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2022-04-08 08:17:54,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1273. [2022-04-08 08:17:54,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:54,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1275 states. Second operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:54,564 INFO L74 IsIncluded]: Start isIncluded. First operand 1275 states. Second operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:54,565 INFO L87 Difference]: Start difference. First operand 1275 states. Second operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:54,640 INFO L93 Difference]: Finished difference Result 1275 states and 2104 transitions. [2022-04-08 08:17:54,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2104 transitions. [2022-04-08 08:17:54,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:54,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:54,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1275 states. [2022-04-08 08:17:54,645 INFO L87 Difference]: Start difference. First operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1275 states. [2022-04-08 08:17:54,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:54,720 INFO L93 Difference]: Finished difference Result 1275 states and 2104 transitions. [2022-04-08 08:17:54,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2104 transitions. [2022-04-08 08:17:54,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:54,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:54,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:54,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:54,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:54,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 2103 transitions. [2022-04-08 08:17:54,867 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 2103 transitions. Word has length 29 [2022-04-08 08:17:54,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:54,868 INFO L478 AbstractCegarLoop]: Abstraction has 1273 states and 2103 transitions. [2022-04-08 08:17:54,868 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:54,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1273 states and 2103 transitions. [2022-04-08 08:17:56,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2103 edges. 2103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:56,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 2103 transitions. [2022-04-08 08:17:56,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 08:17:56,962 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:56,962 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:56,962 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 08:17:56,962 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:56,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:56,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1409651196, now seen corresponding path program 1 times [2022-04-08 08:17:56,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:56,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [976394084] [2022-04-08 08:17:56,963 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:56,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1409651196, now seen corresponding path program 2 times [2022-04-08 08:17:56,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:56,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779250863] [2022-04-08 08:17:56,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:56,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:57,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:57,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {48395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {48389#true} is VALID [2022-04-08 08:17:57,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {48389#true} assume true; {48389#true} is VALID [2022-04-08 08:17:57,005 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48389#true} {48389#true} #251#return; {48389#true} is VALID [2022-04-08 08:17:57,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {48389#true} call ULTIMATE.init(); {48395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:57,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {48395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {48389#true} is VALID [2022-04-08 08:17:57,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {48389#true} assume true; {48389#true} is VALID [2022-04-08 08:17:57,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48389#true} {48389#true} #251#return; {48389#true} is VALID [2022-04-08 08:17:57,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {48389#true} call #t~ret18 := main(); {48389#true} is VALID [2022-04-08 08:17:57,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {48389#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {48389#true} is VALID [2022-04-08 08:17:57,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {48389#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {48389#true} is VALID [2022-04-08 08:17:57,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {48389#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {48389#true} is VALID [2022-04-08 08:17:57,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {48389#true} assume !(0 != ~p1~0); {48389#true} is VALID [2022-04-08 08:17:57,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {48389#true} assume !(0 != ~p2~0); {48389#true} is VALID [2022-04-08 08:17:57,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {48389#true} assume !(0 != ~p3~0); {48389#true} is VALID [2022-04-08 08:17:57,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {48389#true} assume !(0 != ~p4~0); {48389#true} is VALID [2022-04-08 08:17:57,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {48389#true} assume !(0 != ~p5~0); {48389#true} is VALID [2022-04-08 08:17:57,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {48389#true} assume 0 != ~p6~0;~lk6~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:57,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:57,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:57,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:57,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:57,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:57,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:57,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {48394#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:57,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:57,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:57,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:57,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:57,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {48394#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {48394#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:57,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {48394#(= main_~lk6~0 1)} assume 0 != ~p6~0; {48394#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:57,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {48394#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {48390#false} is VALID [2022-04-08 08:17:57,012 INFO L290 TraceCheckUtils]: 28: Hoare triple {48390#false} assume !false; {48390#false} is VALID [2022-04-08 08:17:57,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:57,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:57,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779250863] [2022-04-08 08:17:57,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779250863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:57,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:57,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:57,013 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:57,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [976394084] [2022-04-08 08:17:57,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [976394084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:57,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:57,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:57,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021222137] [2022-04-08 08:17:57,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:57,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 08:17:57,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:57,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:57,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:57,036 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:57,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:57,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:57,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:57,036 INFO L87 Difference]: Start difference. First operand 1273 states and 2103 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:57,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:57,614 INFO L93 Difference]: Finished difference Result 2317 states and 3897 transitions. [2022-04-08 08:17:57,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:57,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 08:17:57,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:57,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-08 08:17:57,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:57,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-08 08:17:57,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-08 08:17:57,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:57,960 INFO L225 Difference]: With dead ends: 2317 [2022-04-08 08:17:57,960 INFO L226 Difference]: Without dead ends: 2315 [2022-04-08 08:17:57,961 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:57,961 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:57,961 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 91 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:17:57,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2022-04-08 08:17:58,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 1801. [2022-04-08 08:17:58,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:58,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2315 states. Second operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:58,125 INFO L74 IsIncluded]: Start isIncluded. First operand 2315 states. Second operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:58,127 INFO L87 Difference]: Start difference. First operand 2315 states. Second operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:58,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:58,358 INFO L93 Difference]: Finished difference Result 2315 states and 3864 transitions. [2022-04-08 08:17:58,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3864 transitions. [2022-04-08 08:17:58,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:58,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:58,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2315 states. [2022-04-08 08:17:58,366 INFO L87 Difference]: Start difference. First operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2315 states. [2022-04-08 08:17:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:58,606 INFO L93 Difference]: Finished difference Result 2315 states and 3864 transitions. [2022-04-08 08:17:58,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3864 transitions. [2022-04-08 08:17:58,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:58,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:58,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:58,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:58,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:58,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2903 transitions. [2022-04-08 08:17:58,848 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2903 transitions. Word has length 29 [2022-04-08 08:17:58,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:58,848 INFO L478 AbstractCegarLoop]: Abstraction has 1801 states and 2903 transitions. [2022-04-08 08:17:58,848 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:58,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1801 states and 2903 transitions. [2022-04-08 08:18:01,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2903 edges. 2903 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:01,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2903 transitions. [2022-04-08 08:18:01,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 08:18:01,735 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:18:01,735 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:18:01,735 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 08:18:01,735 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:18:01,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:18:01,736 INFO L85 PathProgramCache]: Analyzing trace with hash 388582842, now seen corresponding path program 1 times [2022-04-08 08:18:01,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:01,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1663969655] [2022-04-08 08:18:01,736 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:18:01,736 INFO L85 PathProgramCache]: Analyzing trace with hash 388582842, now seen corresponding path program 2 times [2022-04-08 08:18:01,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:18:01,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392521422] [2022-04-08 08:18:01,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:18:01,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:18:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:01,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:18:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:01,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {61273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {61267#true} is VALID [2022-04-08 08:18:01,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-08 08:18:01,807 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61267#true} {61267#true} #251#return; {61267#true} is VALID [2022-04-08 08:18:01,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {61267#true} call ULTIMATE.init(); {61273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:18:01,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {61273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {61267#true} is VALID [2022-04-08 08:18:01,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-08 08:18:01,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61267#true} {61267#true} #251#return; {61267#true} is VALID [2022-04-08 08:18:01,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {61267#true} call #t~ret18 := main(); {61267#true} is VALID [2022-04-08 08:18:01,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {61267#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {61267#true} is VALID [2022-04-08 08:18:01,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {61267#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {61267#true} is VALID [2022-04-08 08:18:01,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {61267#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {61267#true} is VALID [2022-04-08 08:18:01,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {61267#true} assume !(0 != ~p1~0); {61267#true} is VALID [2022-04-08 08:18:01,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {61267#true} assume !(0 != ~p2~0); {61267#true} is VALID [2022-04-08 08:18:01,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {61267#true} assume !(0 != ~p3~0); {61267#true} is VALID [2022-04-08 08:18:01,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {61267#true} assume !(0 != ~p4~0); {61267#true} is VALID [2022-04-08 08:18:01,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {61267#true} assume !(0 != ~p5~0); {61267#true} is VALID [2022-04-08 08:18:01,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {61267#true} assume !(0 != ~p6~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-08 08:18:01,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-08 08:18:01,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-08 08:18:01,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-08 08:18:01,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p10~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-08 08:18:01,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-08 08:18:01,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-08 08:18:01,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {61272#(= main_~p6~0 0)} is VALID [2022-04-08 08:18:01,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p1~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-08 08:18:01,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p2~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-08 08:18:01,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p3~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-08 08:18:01,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p4~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-08 08:18:01,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {61272#(= main_~p6~0 0)} assume !(0 != ~p5~0); {61272#(= main_~p6~0 0)} is VALID [2022-04-08 08:18:01,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {61272#(= main_~p6~0 0)} assume 0 != ~p6~0; {61268#false} is VALID [2022-04-08 08:18:01,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {61268#false} assume 1 != ~lk6~0; {61268#false} is VALID [2022-04-08 08:18:01,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {61268#false} assume !false; {61268#false} is VALID [2022-04-08 08:18:01,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:18:01,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:18:01,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392521422] [2022-04-08 08:18:01,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392521422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:01,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:01,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:01,816 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:18:01,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1663969655] [2022-04-08 08:18:01,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1663969655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:01,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:01,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:01,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133620455] [2022-04-08 08:18:01,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:18:01,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 08:18:01,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:18:01,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:01,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:01,835 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:18:01,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:01,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:18:01,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:18:01,836 INFO L87 Difference]: Start difference. First operand 1801 states and 2903 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:03,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:03,135 INFO L93 Difference]: Finished difference Result 4237 states and 6873 transitions. [2022-04-08 08:18:03,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:18:03,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 08:18:03,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:18:03,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2022-04-08 08:18:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:03,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2022-04-08 08:18:03,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 231 transitions. [2022-04-08 08:18:03,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 231 edges. 231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:03,572 INFO L225 Difference]: With dead ends: 4237 [2022-04-08 08:18:03,573 INFO L226 Difference]: Without dead ends: 2475 [2022-04-08 08:18:03,576 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:18:03,577 INFO L913 BasicCegarLoop]: 122 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:18:03,577 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 129 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:18:03,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2022-04-08 08:18:03,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2473. [2022-04-08 08:18:03,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:18:03,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2475 states. Second operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:03,807 INFO L74 IsIncluded]: Start isIncluded. First operand 2475 states. Second operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:03,808 INFO L87 Difference]: Start difference. First operand 2475 states. Second operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:04,002 INFO L93 Difference]: Finished difference Result 2475 states and 3976 transitions. [2022-04-08 08:18:04,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3976 transitions. [2022-04-08 08:18:04,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:04,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:04,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2475 states. [2022-04-08 08:18:04,009 INFO L87 Difference]: Start difference. First operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2475 states. [2022-04-08 08:18:04,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:04,213 INFO L93 Difference]: Finished difference Result 2475 states and 3976 transitions. [2022-04-08 08:18:04,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3976 transitions. [2022-04-08 08:18:04,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:04,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:04,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:18:04,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:18:04,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3975 transitions. [2022-04-08 08:18:04,559 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3975 transitions. Word has length 29 [2022-04-08 08:18:04,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:18:04,559 INFO L478 AbstractCegarLoop]: Abstraction has 2473 states and 3975 transitions. [2022-04-08 08:18:04,559 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:04,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2473 states and 3975 transitions. [2022-04-08 08:18:08,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3975 edges. 3975 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:08,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3975 transitions. [2022-04-08 08:18:08,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 08:18:08,694 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:18:08,694 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:18:08,694 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 08:18:08,695 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:18:08,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:18:08,695 INFO L85 PathProgramCache]: Analyzing trace with hash 749728232, now seen corresponding path program 1 times [2022-04-08 08:18:08,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:08,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [918722981] [2022-04-08 08:18:08,695 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:18:08,695 INFO L85 PathProgramCache]: Analyzing trace with hash 749728232, now seen corresponding path program 2 times [2022-04-08 08:18:08,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:18:08,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106462804] [2022-04-08 08:18:08,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:18:08,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:18:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:08,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:18:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:08,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {79655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {79649#true} is VALID [2022-04-08 08:18:08,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {79649#true} assume true; {79649#true} is VALID [2022-04-08 08:18:08,751 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79649#true} {79649#true} #251#return; {79649#true} is VALID [2022-04-08 08:18:08,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {79649#true} call ULTIMATE.init(); {79655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:18:08,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {79655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {79649#true} is VALID [2022-04-08 08:18:08,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {79649#true} assume true; {79649#true} is VALID [2022-04-08 08:18:08,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79649#true} {79649#true} #251#return; {79649#true} is VALID [2022-04-08 08:18:08,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {79649#true} call #t~ret18 := main(); {79649#true} is VALID [2022-04-08 08:18:08,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {79649#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {79649#true} is VALID [2022-04-08 08:18:08,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {79649#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {79649#true} is VALID [2022-04-08 08:18:08,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {79649#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {79649#true} is VALID [2022-04-08 08:18:08,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {79649#true} assume !(0 != ~p1~0); {79649#true} is VALID [2022-04-08 08:18:08,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {79649#true} assume !(0 != ~p2~0); {79649#true} is VALID [2022-04-08 08:18:08,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {79649#true} assume !(0 != ~p3~0); {79649#true} is VALID [2022-04-08 08:18:08,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {79649#true} assume !(0 != ~p4~0); {79649#true} is VALID [2022-04-08 08:18:08,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {79649#true} assume !(0 != ~p5~0); {79649#true} is VALID [2022-04-08 08:18:08,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {79649#true} assume 0 != ~p6~0;~lk6~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:08,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:08,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:08,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:08,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:08,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:08,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:08,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {79654#(not (= main_~p6~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {79654#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:08,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:08,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:08,756 INFO L290 TraceCheckUtils]: 23: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:08,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:08,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {79654#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:08,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {79654#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {79650#false} is VALID [2022-04-08 08:18:08,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {79650#false} assume 0 != ~p7~0; {79650#false} is VALID [2022-04-08 08:18:08,757 INFO L290 TraceCheckUtils]: 28: Hoare triple {79650#false} assume 1 != ~lk7~0; {79650#false} is VALID [2022-04-08 08:18:08,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {79650#false} assume !false; {79650#false} is VALID [2022-04-08 08:18:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:18:08,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:18:08,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106462804] [2022-04-08 08:18:08,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106462804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:08,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:08,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:08,757 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:18:08,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [918722981] [2022-04-08 08:18:08,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [918722981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:08,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:08,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:08,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214132757] [2022-04-08 08:18:08,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:18:08,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 08:18:08,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:18:08,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:08,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:08,781 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:18:08,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:08,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:18:08,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:18:08,781 INFO L87 Difference]: Start difference. First operand 2473 states and 3975 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:09,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:09,789 INFO L93 Difference]: Finished difference Result 3709 states and 5945 transitions. [2022-04-08 08:18:09,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:18:09,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 08:18:09,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:18:09,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:09,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2022-04-08 08:18:09,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:09,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2022-04-08 08:18:09,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 226 transitions. [2022-04-08 08:18:09,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:10,240 INFO L225 Difference]: With dead ends: 3709 [2022-04-08 08:18:10,241 INFO L226 Difference]: Without dead ends: 2507 [2022-04-08 08:18:10,243 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:18:10,243 INFO L913 BasicCegarLoop]: 121 mSDtfsCounter, 165 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:18:10,244 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 128 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:18:10,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-04-08 08:18:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2505. [2022-04-08 08:18:10,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:18:10,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2507 states. Second operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:10,478 INFO L74 IsIncluded]: Start isIncluded. First operand 2507 states. Second operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:10,480 INFO L87 Difference]: Start difference. First operand 2507 states. Second operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:10,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:10,668 INFO L93 Difference]: Finished difference Result 2507 states and 3976 transitions. [2022-04-08 08:18:10,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3976 transitions. [2022-04-08 08:18:10,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:10,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:10,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2507 states. [2022-04-08 08:18:10,674 INFO L87 Difference]: Start difference. First operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2507 states. [2022-04-08 08:18:10,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:10,856 INFO L93 Difference]: Finished difference Result 2507 states and 3976 transitions. [2022-04-08 08:18:10,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3976 transitions. [2022-04-08 08:18:10,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:10,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:10,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:18:10,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:18:10,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3975 transitions. [2022-04-08 08:18:11,240 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3975 transitions. Word has length 30 [2022-04-08 08:18:11,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:18:11,240 INFO L478 AbstractCegarLoop]: Abstraction has 2505 states and 3975 transitions. [2022-04-08 08:18:11,240 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:11,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2505 states and 3975 transitions. [2022-04-08 08:18:15,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3975 edges. 3975 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:15,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3975 transitions. [2022-04-08 08:18:15,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 08:18:15,359 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:18:15,359 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:18:15,359 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 08:18:15,359 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:18:15,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:18:15,359 INFO L85 PathProgramCache]: Analyzing trace with hash -838619670, now seen corresponding path program 1 times [2022-04-08 08:18:15,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:15,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [27485511] [2022-04-08 08:18:15,360 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:18:15,360 INFO L85 PathProgramCache]: Analyzing trace with hash -838619670, now seen corresponding path program 2 times [2022-04-08 08:18:15,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:18:15,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311544973] [2022-04-08 08:18:15,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:18:15,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:18:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:15,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:18:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:15,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {97109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {97103#true} is VALID [2022-04-08 08:18:15,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {97103#true} assume true; {97103#true} is VALID [2022-04-08 08:18:15,399 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {97103#true} {97103#true} #251#return; {97103#true} is VALID [2022-04-08 08:18:15,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {97103#true} call ULTIMATE.init(); {97109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:18:15,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {97109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {97103#true} is VALID [2022-04-08 08:18:15,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {97103#true} assume true; {97103#true} is VALID [2022-04-08 08:18:15,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97103#true} {97103#true} #251#return; {97103#true} is VALID [2022-04-08 08:18:15,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {97103#true} call #t~ret18 := main(); {97103#true} is VALID [2022-04-08 08:18:15,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {97103#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {97103#true} is VALID [2022-04-08 08:18:15,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {97103#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {97103#true} is VALID [2022-04-08 08:18:15,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {97103#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {97103#true} is VALID [2022-04-08 08:18:15,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {97103#true} assume !(0 != ~p1~0); {97103#true} is VALID [2022-04-08 08:18:15,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {97103#true} assume !(0 != ~p2~0); {97103#true} is VALID [2022-04-08 08:18:15,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {97103#true} assume !(0 != ~p3~0); {97103#true} is VALID [2022-04-08 08:18:15,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {97103#true} assume !(0 != ~p4~0); {97103#true} is VALID [2022-04-08 08:18:15,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {97103#true} assume !(0 != ~p5~0); {97103#true} is VALID [2022-04-08 08:18:15,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {97103#true} assume !(0 != ~p6~0); {97103#true} is VALID [2022-04-08 08:18:15,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {97103#true} assume 0 != ~p7~0;~lk7~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:15,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:15,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:15,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:15,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:15,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:15,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {97108#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:15,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:15,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:15,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:15,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:15,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:15,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {97108#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {97108#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:15,414 INFO L290 TraceCheckUtils]: 27: Hoare triple {97108#(= main_~lk7~0 1)} assume 0 != ~p7~0; {97108#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:15,414 INFO L290 TraceCheckUtils]: 28: Hoare triple {97108#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {97104#false} is VALID [2022-04-08 08:18:15,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {97104#false} assume !false; {97104#false} is VALID [2022-04-08 08:18:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:18:15,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:18:15,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311544973] [2022-04-08 08:18:15,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311544973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:15,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:15,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:15,415 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:18:15,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [27485511] [2022-04-08 08:18:15,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [27485511] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:15,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:15,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:15,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722325020] [2022-04-08 08:18:15,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:18:15,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 08:18:15,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:18:15,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:15,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:15,435 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:18:15,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:15,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:18:15,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:18:15,436 INFO L87 Difference]: Start difference. First operand 2505 states and 3975 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:16,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:16,923 INFO L93 Difference]: Finished difference Result 4493 states and 7273 transitions. [2022-04-08 08:18:16,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:18:16,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 08:18:16,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:18:16,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-08 08:18:16,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-08 08:18:16,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 143 transitions. [2022-04-08 08:18:17,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:17,895 INFO L225 Difference]: With dead ends: 4493 [2022-04-08 08:18:17,896 INFO L226 Difference]: Without dead ends: 4491 [2022-04-08 08:18:17,896 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:18:17,897 INFO L913 BasicCegarLoop]: 83 mSDtfsCounter, 177 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:18:17,897 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 90 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:18:17,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2022-04-08 08:18:18,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 3593. [2022-04-08 08:18:18,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:18:18,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4491 states. Second operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:18,221 INFO L74 IsIncluded]: Start isIncluded. First operand 4491 states. Second operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:18,223 INFO L87 Difference]: Start difference. First operand 4491 states. Second operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:18,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:18,923 INFO L93 Difference]: Finished difference Result 4491 states and 7208 transitions. [2022-04-08 08:18:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 7208 transitions. [2022-04-08 08:18:18,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:18,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:18,933 INFO L74 IsIncluded]: Start isIncluded. First operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4491 states. [2022-04-08 08:18:18,935 INFO L87 Difference]: Start difference. First operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4491 states. [2022-04-08 08:18:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:19,549 INFO L93 Difference]: Finished difference Result 4491 states and 7208 transitions. [2022-04-08 08:18:19,549 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 7208 transitions. [2022-04-08 08:18:19,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:19,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:19,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:18:19,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:18:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:20,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3593 states and 5543 transitions. [2022-04-08 08:18:20,225 INFO L78 Accepts]: Start accepts. Automaton has 3593 states and 5543 transitions. Word has length 30 [2022-04-08 08:18:20,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:18:20,225 INFO L478 AbstractCegarLoop]: Abstraction has 3593 states and 5543 transitions. [2022-04-08 08:18:20,225 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:20,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3593 states and 5543 transitions. [2022-04-08 08:18:26,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5543 edges. 5543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:26,058 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 5543 transitions. [2022-04-08 08:18:26,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 08:18:26,061 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:18:26,061 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:18:26,061 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 08:18:26,061 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:18:26,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:18:26,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1859688024, now seen corresponding path program 1 times [2022-04-08 08:18:26,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:26,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1560763104] [2022-04-08 08:18:26,062 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:18:26,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1859688024, now seen corresponding path program 2 times [2022-04-08 08:18:26,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:18:26,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084943393] [2022-04-08 08:18:26,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:18:26,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:18:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:26,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:18:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:26,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {122275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {122269#true} is VALID [2022-04-08 08:18:26,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {122269#true} assume true; {122269#true} is VALID [2022-04-08 08:18:26,110 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {122269#true} {122269#true} #251#return; {122269#true} is VALID [2022-04-08 08:18:26,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {122269#true} call ULTIMATE.init(); {122275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:18:26,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {122275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {122269#true} is VALID [2022-04-08 08:18:26,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {122269#true} assume true; {122269#true} is VALID [2022-04-08 08:18:26,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122269#true} {122269#true} #251#return; {122269#true} is VALID [2022-04-08 08:18:26,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {122269#true} call #t~ret18 := main(); {122269#true} is VALID [2022-04-08 08:18:26,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {122269#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {122269#true} is VALID [2022-04-08 08:18:26,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {122269#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {122269#true} is VALID [2022-04-08 08:18:26,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {122269#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {122269#true} is VALID [2022-04-08 08:18:26,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {122269#true} assume !(0 != ~p1~0); {122269#true} is VALID [2022-04-08 08:18:26,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {122269#true} assume !(0 != ~p2~0); {122269#true} is VALID [2022-04-08 08:18:26,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {122269#true} assume !(0 != ~p3~0); {122269#true} is VALID [2022-04-08 08:18:26,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {122269#true} assume !(0 != ~p4~0); {122269#true} is VALID [2022-04-08 08:18:26,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {122269#true} assume !(0 != ~p5~0); {122269#true} is VALID [2022-04-08 08:18:26,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {122269#true} assume !(0 != ~p6~0); {122269#true} is VALID [2022-04-08 08:18:26,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {122269#true} assume !(0 != ~p7~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:26,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {122274#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:26,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {122274#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:26,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p10~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:26,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {122274#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:26,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {122274#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:26,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {122274#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:26,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p1~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:26,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p2~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:26,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p3~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:26,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p4~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:26,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p5~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:26,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {122274#(= main_~p7~0 0)} assume !(0 != ~p6~0); {122274#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:26,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {122274#(= main_~p7~0 0)} assume 0 != ~p7~0; {122270#false} is VALID [2022-04-08 08:18:26,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {122270#false} assume 1 != ~lk7~0; {122270#false} is VALID [2022-04-08 08:18:26,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {122270#false} assume !false; {122270#false} is VALID [2022-04-08 08:18:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:18:26,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:18:26,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084943393] [2022-04-08 08:18:26,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084943393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:26,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:26,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:26,117 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:18:26,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1560763104] [2022-04-08 08:18:26,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1560763104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:26,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:26,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:26,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238113908] [2022-04-08 08:18:26,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:18:26,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 08:18:26,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:18:26,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:26,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:26,136 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:18:26,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:26,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:18:26,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:18:26,137 INFO L87 Difference]: Start difference. First operand 3593 states and 5543 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:30,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:30,192 INFO L93 Difference]: Finished difference Result 8397 states and 13033 transitions. [2022-04-08 08:18:30,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:18:30,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 08:18:30,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:18:30,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:30,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-08 08:18:30,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-08 08:18:30,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 228 transitions. [2022-04-08 08:18:30,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:31,340 INFO L225 Difference]: With dead ends: 8397 [2022-04-08 08:18:31,340 INFO L226 Difference]: Without dead ends: 4875 [2022-04-08 08:18:31,344 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:18:31,345 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:18:31,345 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 131 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:18:31,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2022-04-08 08:18:31,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 4873. [2022-04-08 08:18:31,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:18:31,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4875 states. Second operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:31,796 INFO L74 IsIncluded]: Start isIncluded. First operand 4875 states. Second operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:31,799 INFO L87 Difference]: Start difference. First operand 4875 states. Second operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:32,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:32,590 INFO L93 Difference]: Finished difference Result 4875 states and 7496 transitions. [2022-04-08 08:18:32,590 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7496 transitions. [2022-04-08 08:18:32,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:32,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:32,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4875 states. [2022-04-08 08:18:32,605 INFO L87 Difference]: Start difference. First operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4875 states. [2022-04-08 08:18:33,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:33,414 INFO L93 Difference]: Finished difference Result 4875 states and 7496 transitions. [2022-04-08 08:18:33,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7496 transitions. [2022-04-08 08:18:33,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:33,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:33,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:18:33,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:18:33,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4873 states to 4873 states and 7495 transitions. [2022-04-08 08:18:34,695 INFO L78 Accepts]: Start accepts. Automaton has 4873 states and 7495 transitions. Word has length 30 [2022-04-08 08:18:34,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:18:34,696 INFO L478 AbstractCegarLoop]: Abstraction has 4873 states and 7495 transitions. [2022-04-08 08:18:34,696 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:34,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4873 states and 7495 transitions. [2022-04-08 08:18:42,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7495 edges. 7495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:42,766 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 7495 transitions. [2022-04-08 08:18:42,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 08:18:42,769 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:18:42,769 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:18:42,769 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 08:18:42,770 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:18:42,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:18:42,770 INFO L85 PathProgramCache]: Analyzing trace with hash -227191537, now seen corresponding path program 1 times [2022-04-08 08:18:42,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:42,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [805327700] [2022-04-08 08:18:42,770 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:18:42,771 INFO L85 PathProgramCache]: Analyzing trace with hash -227191537, now seen corresponding path program 2 times [2022-04-08 08:18:42,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:18:42,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646502524] [2022-04-08 08:18:42,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:18:42,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:18:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:42,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:18:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:42,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {158577#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {158571#true} is VALID [2022-04-08 08:18:42,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {158571#true} assume true; {158571#true} is VALID [2022-04-08 08:18:42,807 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158571#true} {158571#true} #251#return; {158571#true} is VALID [2022-04-08 08:18:42,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {158571#true} call ULTIMATE.init(); {158577#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:18:42,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {158577#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {158571#true} is VALID [2022-04-08 08:18:42,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {158571#true} assume true; {158571#true} is VALID [2022-04-08 08:18:42,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158571#true} {158571#true} #251#return; {158571#true} is VALID [2022-04-08 08:18:42,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {158571#true} call #t~ret18 := main(); {158571#true} is VALID [2022-04-08 08:18:42,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {158571#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {158571#true} is VALID [2022-04-08 08:18:42,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {158571#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {158571#true} is VALID [2022-04-08 08:18:42,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {158571#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {158571#true} is VALID [2022-04-08 08:18:42,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {158571#true} assume !(0 != ~p1~0); {158571#true} is VALID [2022-04-08 08:18:42,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {158571#true} assume !(0 != ~p2~0); {158571#true} is VALID [2022-04-08 08:18:42,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {158571#true} assume !(0 != ~p3~0); {158571#true} is VALID [2022-04-08 08:18:42,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {158571#true} assume !(0 != ~p4~0); {158571#true} is VALID [2022-04-08 08:18:42,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {158571#true} assume !(0 != ~p5~0); {158571#true} is VALID [2022-04-08 08:18:42,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {158571#true} assume !(0 != ~p6~0); {158571#true} is VALID [2022-04-08 08:18:42,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {158571#true} assume 0 != ~p7~0;~lk7~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:42,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:42,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:42,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:42,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:42,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:42,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {158576#(not (= main_~p7~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {158576#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:42,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:42,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:42,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:42,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:42,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:42,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {158576#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:42,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {158576#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {158572#false} is VALID [2022-04-08 08:18:42,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {158572#false} assume 0 != ~p8~0; {158572#false} is VALID [2022-04-08 08:18:42,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {158572#false} assume 1 != ~lk8~0; {158572#false} is VALID [2022-04-08 08:18:42,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {158572#false} assume !false; {158572#false} is VALID [2022-04-08 08:18:42,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:18:42,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:18:42,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646502524] [2022-04-08 08:18:42,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646502524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:42,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:42,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:42,815 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:18:42,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [805327700] [2022-04-08 08:18:42,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [805327700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:42,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:42,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:42,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289252913] [2022-04-08 08:18:42,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:18:42,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 08:18:42,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:18:42,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:42,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:42,835 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:18:42,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:42,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:18:42,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:18:42,836 INFO L87 Difference]: Start difference. First operand 4873 states and 7495 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:46,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:46,022 INFO L93 Difference]: Finished difference Result 7309 states and 11209 transitions. [2022-04-08 08:18:46,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:18:46,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 08:18:46,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:18:46,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:46,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-08 08:18:46,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:46,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-08 08:18:46,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 223 transitions. [2022-04-08 08:18:46,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:47,206 INFO L225 Difference]: With dead ends: 7309 [2022-04-08 08:18:47,207 INFO L226 Difference]: Without dead ends: 4939 [2022-04-08 08:18:47,209 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:18:47,210 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 164 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:18:47,210 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 125 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:18:47,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2022-04-08 08:18:47,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4937. [2022-04-08 08:18:47,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:18:47,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4939 states. Second operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:47,604 INFO L74 IsIncluded]: Start isIncluded. First operand 4939 states. Second operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:47,607 INFO L87 Difference]: Start difference. First operand 4939 states. Second operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:48,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:48,329 INFO L93 Difference]: Finished difference Result 4939 states and 7496 transitions. [2022-04-08 08:18:48,329 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 7496 transitions. [2022-04-08 08:18:48,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:48,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:48,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4939 states. [2022-04-08 08:18:48,343 INFO L87 Difference]: Start difference. First operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4939 states. [2022-04-08 08:18:49,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:49,114 INFO L93 Difference]: Finished difference Result 4939 states and 7496 transitions. [2022-04-08 08:18:49,114 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 7496 transitions. [2022-04-08 08:18:49,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:49,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:49,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:18:49,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:18:49,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4937 states to 4937 states and 7495 transitions. [2022-04-08 08:18:50,387 INFO L78 Accepts]: Start accepts. Automaton has 4937 states and 7495 transitions. Word has length 31 [2022-04-08 08:18:50,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:18:50,387 INFO L478 AbstractCegarLoop]: Abstraction has 4937 states and 7495 transitions. [2022-04-08 08:18:50,387 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:50,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4937 states and 7495 transitions. [2022-04-08 08:18:58,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7495 edges. 7495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 4937 states and 7495 transitions. [2022-04-08 08:18:58,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 08:18:58,401 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:18:58,401 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:18:58,401 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 08:18:58,401 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:18:58,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:18:58,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1815539439, now seen corresponding path program 1 times [2022-04-08 08:18:58,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:58,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [513392572] [2022-04-08 08:18:58,402 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:18:58,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1815539439, now seen corresponding path program 2 times [2022-04-08 08:18:58,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:18:58,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723759150] [2022-04-08 08:18:58,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:18:58,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:18:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:58,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:18:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:58,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {192959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {192953#true} is VALID [2022-04-08 08:18:58,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {192953#true} assume true; {192953#true} is VALID [2022-04-08 08:18:58,450 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {192953#true} {192953#true} #251#return; {192953#true} is VALID [2022-04-08 08:18:58,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {192953#true} call ULTIMATE.init(); {192959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:18:58,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {192959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {192953#true} is VALID [2022-04-08 08:18:58,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {192953#true} assume true; {192953#true} is VALID [2022-04-08 08:18:58,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {192953#true} {192953#true} #251#return; {192953#true} is VALID [2022-04-08 08:18:58,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {192953#true} call #t~ret18 := main(); {192953#true} is VALID [2022-04-08 08:18:58,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {192953#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {192953#true} is VALID [2022-04-08 08:18:58,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {192953#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {192953#true} is VALID [2022-04-08 08:18:58,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {192953#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {192953#true} is VALID [2022-04-08 08:18:58,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {192953#true} assume !(0 != ~p1~0); {192953#true} is VALID [2022-04-08 08:18:58,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {192953#true} assume !(0 != ~p2~0); {192953#true} is VALID [2022-04-08 08:18:58,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {192953#true} assume !(0 != ~p3~0); {192953#true} is VALID [2022-04-08 08:18:58,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {192953#true} assume !(0 != ~p4~0); {192953#true} is VALID [2022-04-08 08:18:58,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {192953#true} assume !(0 != ~p5~0); {192953#true} is VALID [2022-04-08 08:18:58,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {192953#true} assume !(0 != ~p6~0); {192953#true} is VALID [2022-04-08 08:18:58,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {192953#true} assume !(0 != ~p7~0); {192953#true} is VALID [2022-04-08 08:18:58,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {192953#true} assume 0 != ~p8~0;~lk8~0 := 1; {192958#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:58,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {192958#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:58,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:58,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {192958#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:58,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {192958#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:58,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {192958#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:58,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:58,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:58,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:58,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:58,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:58,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:58,456 INFO L290 TraceCheckUtils]: 27: Hoare triple {192958#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {192958#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:58,456 INFO L290 TraceCheckUtils]: 28: Hoare triple {192958#(= main_~lk8~0 1)} assume 0 != ~p8~0; {192958#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:58,457 INFO L290 TraceCheckUtils]: 29: Hoare triple {192958#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {192954#false} is VALID [2022-04-08 08:18:58,457 INFO L290 TraceCheckUtils]: 30: Hoare triple {192954#false} assume !false; {192954#false} is VALID [2022-04-08 08:18:58,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:18:58,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:18:58,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723759150] [2022-04-08 08:18:58,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723759150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:58,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:58,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:58,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:18:58,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [513392572] [2022-04-08 08:18:58,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [513392572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:58,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:58,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:58,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422193084] [2022-04-08 08:18:58,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:18:58,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 08:18:58,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:18:58,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:58,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:58,479 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:18:58,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:58,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:18:58,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:18:58,479 INFO L87 Difference]: Start difference. First operand 4937 states and 7495 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:03,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:03,012 INFO L93 Difference]: Finished difference Result 8717 states and 13513 transitions. [2022-04-08 08:19:03,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:03,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 08:19:03,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:03,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-08 08:19:03,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-08 08:19:03,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-08 08:19:03,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:06,765 INFO L225 Difference]: With dead ends: 8717 [2022-04-08 08:19:06,765 INFO L226 Difference]: Without dead ends: 8715 [2022-04-08 08:19:06,767 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:06,767 INFO L913 BasicCegarLoop]: 82 mSDtfsCounter, 170 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:06,767 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 89 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:06,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8715 states. [2022-04-08 08:19:07,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8715 to 7177. [2022-04-08 08:19:07,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:07,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8715 states. Second operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:07,396 INFO L74 IsIncluded]: Start isIncluded. First operand 8715 states. Second operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:07,401 INFO L87 Difference]: Start difference. First operand 8715 states. Second operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:10,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:10,206 INFO L93 Difference]: Finished difference Result 8715 states and 13384 transitions. [2022-04-08 08:19:10,206 INFO L276 IsEmpty]: Start isEmpty. Operand 8715 states and 13384 transitions. [2022-04-08 08:19:10,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:10,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:10,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8715 states. [2022-04-08 08:19:10,224 INFO L87 Difference]: Start difference. First operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8715 states. [2022-04-08 08:19:13,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:13,039 INFO L93 Difference]: Finished difference Result 8715 states and 13384 transitions. [2022-04-08 08:19:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand 8715 states and 13384 transitions. [2022-04-08 08:19:13,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:13,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:13,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:13,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:13,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:15,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7177 states to 7177 states and 10567 transitions. [2022-04-08 08:19:15,911 INFO L78 Accepts]: Start accepts. Automaton has 7177 states and 10567 transitions. Word has length 31 [2022-04-08 08:19:15,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:15,911 INFO L478 AbstractCegarLoop]: Abstraction has 7177 states and 10567 transitions. [2022-04-08 08:19:15,911 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:15,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7177 states and 10567 transitions. [2022-04-08 08:19:27,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10567 edges. 10567 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:27,341 INFO L276 IsEmpty]: Start isEmpty. Operand 7177 states and 10567 transitions. [2022-04-08 08:19:27,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 08:19:27,347 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:27,348 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:27,348 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 08:19:27,348 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:27,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:27,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1458359503, now seen corresponding path program 1 times [2022-04-08 08:19:27,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:27,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [262462664] [2022-04-08 08:19:27,349 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:27,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1458359503, now seen corresponding path program 2 times [2022-04-08 08:19:27,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:27,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565272686] [2022-04-08 08:19:27,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:27,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:27,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:27,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {242189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {242183#true} is VALID [2022-04-08 08:19:27,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {242183#true} assume true; {242183#true} is VALID [2022-04-08 08:19:27,381 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {242183#true} {242183#true} #251#return; {242183#true} is VALID [2022-04-08 08:19:27,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {242183#true} call ULTIMATE.init(); {242189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:27,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {242189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {242183#true} is VALID [2022-04-08 08:19:27,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {242183#true} assume true; {242183#true} is VALID [2022-04-08 08:19:27,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {242183#true} {242183#true} #251#return; {242183#true} is VALID [2022-04-08 08:19:27,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {242183#true} call #t~ret18 := main(); {242183#true} is VALID [2022-04-08 08:19:27,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {242183#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {242183#true} is VALID [2022-04-08 08:19:27,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {242183#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {242183#true} is VALID [2022-04-08 08:19:27,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {242183#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {242183#true} is VALID [2022-04-08 08:19:27,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {242183#true} assume !(0 != ~p1~0); {242183#true} is VALID [2022-04-08 08:19:27,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {242183#true} assume !(0 != ~p2~0); {242183#true} is VALID [2022-04-08 08:19:27,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {242183#true} assume !(0 != ~p3~0); {242183#true} is VALID [2022-04-08 08:19:27,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {242183#true} assume !(0 != ~p4~0); {242183#true} is VALID [2022-04-08 08:19:27,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {242183#true} assume !(0 != ~p5~0); {242183#true} is VALID [2022-04-08 08:19:27,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {242183#true} assume !(0 != ~p6~0); {242183#true} is VALID [2022-04-08 08:19:27,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {242183#true} assume !(0 != ~p7~0); {242183#true} is VALID [2022-04-08 08:19:27,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {242183#true} assume !(0 != ~p8~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:27,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {242188#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:27,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p10~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:27,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {242188#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:27,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {242188#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:27,385 INFO L290 TraceCheckUtils]: 20: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {242188#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:27,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p1~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:27,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p2~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:27,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p3~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:27,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p4~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:27,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p5~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:27,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p6~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:27,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {242188#(= main_~p8~0 0)} assume !(0 != ~p7~0); {242188#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:27,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {242188#(= main_~p8~0 0)} assume 0 != ~p8~0; {242184#false} is VALID [2022-04-08 08:19:27,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {242184#false} assume 1 != ~lk8~0; {242184#false} is VALID [2022-04-08 08:19:27,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {242184#false} assume !false; {242184#false} is VALID [2022-04-08 08:19:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:27,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:27,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565272686] [2022-04-08 08:19:27,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565272686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:27,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:27,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:27,389 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:27,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [262462664] [2022-04-08 08:19:27,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [262462664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:27,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:27,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:27,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790828227] [2022-04-08 08:19:27,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:27,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 08:19:27,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:27,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:27,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:27,408 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:27,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:27,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:27,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:27,409 INFO L87 Difference]: Start difference. First operand 7177 states and 10567 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:42,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:42,753 INFO L93 Difference]: Finished difference Result 16653 states and 24649 transitions. [2022-04-08 08:19:42,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:42,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 08:19:42,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:42,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions. [2022-04-08 08:19:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:42,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions. [2022-04-08 08:19:42,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 225 transitions. [2022-04-08 08:19:42,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:47,201 INFO L225 Difference]: With dead ends: 16653 [2022-04-08 08:19:47,201 INFO L226 Difference]: Without dead ends: 9611 [2022-04-08 08:19:47,208 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:47,209 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:47,210 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 133 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:47,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9611 states. [2022-04-08 08:19:47,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9611 to 9609. [2022-04-08 08:19:47,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:47,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9611 states. Second operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:48,006 INFO L74 IsIncluded]: Start isIncluded. First operand 9611 states. Second operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:48,014 INFO L87 Difference]: Start difference. First operand 9611 states. Second operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:50,843 INFO L93 Difference]: Finished difference Result 9611 states and 14088 transitions. [2022-04-08 08:19:50,843 INFO L276 IsEmpty]: Start isEmpty. Operand 9611 states and 14088 transitions. [2022-04-08 08:19:50,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:50,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:50,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 9611 states. [2022-04-08 08:19:50,883 INFO L87 Difference]: Start difference. First operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 9611 states. [2022-04-08 08:19:54,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:54,161 INFO L93 Difference]: Finished difference Result 9611 states and 14088 transitions. [2022-04-08 08:19:54,161 INFO L276 IsEmpty]: Start isEmpty. Operand 9611 states and 14088 transitions. [2022-04-08 08:19:54,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:54,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:54,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:54,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9609 states to 9609 states and 14087 transitions. [2022-04-08 08:19:58,857 INFO L78 Accepts]: Start accepts. Automaton has 9609 states and 14087 transitions. Word has length 31 [2022-04-08 08:19:58,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:58,857 INFO L478 AbstractCegarLoop]: Abstraction has 9609 states and 14087 transitions. [2022-04-08 08:19:58,857 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:58,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9609 states and 14087 transitions. [2022-04-08 08:20:14,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14087 edges. 14087 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:14,867 INFO L276 IsEmpty]: Start isEmpty. Operand 9609 states and 14087 transitions. [2022-04-08 08:20:14,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 08:20:14,874 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:14,874 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:14,874 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 08:20:14,874 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:14,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:14,875 INFO L85 PathProgramCache]: Analyzing trace with hash -446932963, now seen corresponding path program 1 times [2022-04-08 08:20:14,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:14,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1540255328] [2022-04-08 08:20:14,875 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:14,875 INFO L85 PathProgramCache]: Analyzing trace with hash -446932963, now seen corresponding path program 2 times [2022-04-08 08:20:14,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:14,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893883233] [2022-04-08 08:20:14,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:14,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:14,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:14,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {313947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {313941#true} is VALID [2022-04-08 08:20:14,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {313941#true} assume true; {313941#true} is VALID [2022-04-08 08:20:14,906 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {313941#true} {313941#true} #251#return; {313941#true} is VALID [2022-04-08 08:20:14,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {313941#true} call ULTIMATE.init(); {313947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:14,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {313947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {313941#true} is VALID [2022-04-08 08:20:14,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {313941#true} assume true; {313941#true} is VALID [2022-04-08 08:20:14,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {313941#true} {313941#true} #251#return; {313941#true} is VALID [2022-04-08 08:20:14,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {313941#true} call #t~ret18 := main(); {313941#true} is VALID [2022-04-08 08:20:14,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {313941#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {313941#true} is VALID [2022-04-08 08:20:14,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {313941#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {313941#true} is VALID [2022-04-08 08:20:14,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {313941#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {313941#true} is VALID [2022-04-08 08:20:14,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {313941#true} assume !(0 != ~p1~0); {313941#true} is VALID [2022-04-08 08:20:14,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {313941#true} assume !(0 != ~p2~0); {313941#true} is VALID [2022-04-08 08:20:14,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {313941#true} assume !(0 != ~p3~0); {313941#true} is VALID [2022-04-08 08:20:14,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {313941#true} assume !(0 != ~p4~0); {313941#true} is VALID [2022-04-08 08:20:14,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {313941#true} assume !(0 != ~p5~0); {313941#true} is VALID [2022-04-08 08:20:14,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {313941#true} assume !(0 != ~p6~0); {313941#true} is VALID [2022-04-08 08:20:14,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {313941#true} assume !(0 != ~p7~0); {313941#true} is VALID [2022-04-08 08:20:14,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {313941#true} assume 0 != ~p8~0;~lk8~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:20:14,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {313946#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:20:14,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:20:14,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {313946#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:20:14,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {313946#(not (= main_~p8~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:20:14,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {313946#(not (= main_~p8~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {313946#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:20:14,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:20:14,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:20:14,911 INFO L290 TraceCheckUtils]: 23: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:20:14,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:20:14,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:20:14,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:20:14,912 INFO L290 TraceCheckUtils]: 27: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {313946#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:20:14,913 INFO L290 TraceCheckUtils]: 28: Hoare triple {313946#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {313942#false} is VALID [2022-04-08 08:20:14,913 INFO L290 TraceCheckUtils]: 29: Hoare triple {313942#false} assume 0 != ~p9~0; {313942#false} is VALID [2022-04-08 08:20:14,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {313942#false} assume 1 != ~lk9~0; {313942#false} is VALID [2022-04-08 08:20:14,913 INFO L290 TraceCheckUtils]: 31: Hoare triple {313942#false} assume !false; {313942#false} is VALID [2022-04-08 08:20:14,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:20:14,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:14,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893883233] [2022-04-08 08:20:14,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893883233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:14,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:14,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:14,914 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:14,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1540255328] [2022-04-08 08:20:14,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1540255328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:14,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:14,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:14,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386595782] [2022-04-08 08:20:14,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:14,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 08:20:14,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:14,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:14,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:14,934 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:14,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:14,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:14,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:14,935 INFO L87 Difference]: Start difference. First operand 9609 states and 14087 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:26,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:26,688 INFO L93 Difference]: Finished difference Result 14413 states and 21065 transitions. [2022-04-08 08:20:26,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:26,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 08:20:26,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:26,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2022-04-08 08:20:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2022-04-08 08:20:26,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 220 transitions. [2022-04-08 08:20:26,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:30,856 INFO L225 Difference]: With dead ends: 14413 [2022-04-08 08:20:30,856 INFO L226 Difference]: Without dead ends: 9739 [2022-04-08 08:20:30,862 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:30,862 INFO L913 BasicCegarLoop]: 115 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:30,863 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 122 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:30,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9739 states. [2022-04-08 08:20:31,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9739 to 9737. [2022-04-08 08:20:31,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:31,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9739 states. Second operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:31,717 INFO L74 IsIncluded]: Start isIncluded. First operand 9739 states. Second operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:31,727 INFO L87 Difference]: Start difference. First operand 9739 states. Second operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:34,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:34,762 INFO L93 Difference]: Finished difference Result 9739 states and 14088 transitions. [2022-04-08 08:20:34,762 INFO L276 IsEmpty]: Start isEmpty. Operand 9739 states and 14088 transitions. [2022-04-08 08:20:34,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:34,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:34,780 INFO L74 IsIncluded]: Start isIncluded. First operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 9739 states. [2022-04-08 08:20:34,791 INFO L87 Difference]: Start difference. First operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 9739 states. [2022-04-08 08:20:37,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:37,989 INFO L93 Difference]: Finished difference Result 9739 states and 14088 transitions. [2022-04-08 08:20:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 9739 states and 14088 transitions. [2022-04-08 08:20:37,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:37,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:37,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:37,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:38,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:42,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9737 states to 9737 states and 14087 transitions. [2022-04-08 08:20:42,674 INFO L78 Accepts]: Start accepts. Automaton has 9737 states and 14087 transitions. Word has length 32 [2022-04-08 08:20:42,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:42,674 INFO L478 AbstractCegarLoop]: Abstraction has 9737 states and 14087 transitions. [2022-04-08 08:20:42,674 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:42,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9737 states and 14087 transitions. [2022-04-08 08:20:58,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14087 edges. 14087 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:58,532 INFO L276 IsEmpty]: Start isEmpty. Operand 9737 states and 14087 transitions. [2022-04-08 08:20:58,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 08:20:58,561 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:58,561 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:58,561 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 08:20:58,562 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:58,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:58,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2035280865, now seen corresponding path program 1 times [2022-04-08 08:20:58,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:58,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1368375096] [2022-04-08 08:20:58,563 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:58,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2035280865, now seen corresponding path program 2 times [2022-04-08 08:20:58,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:58,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637528432] [2022-04-08 08:20:58,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:58,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:58,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:58,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {381737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {381731#true} is VALID [2022-04-08 08:20:58,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {381731#true} assume true; {381731#true} is VALID [2022-04-08 08:20:58,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {381731#true} {381731#true} #251#return; {381731#true} is VALID [2022-04-08 08:20:58,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {381731#true} call ULTIMATE.init(); {381737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:58,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {381737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {381731#true} is VALID [2022-04-08 08:20:58,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {381731#true} assume true; {381731#true} is VALID [2022-04-08 08:20:58,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {381731#true} {381731#true} #251#return; {381731#true} is VALID [2022-04-08 08:20:58,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {381731#true} call #t~ret18 := main(); {381731#true} is VALID [2022-04-08 08:20:58,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {381731#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {381731#true} is VALID [2022-04-08 08:20:58,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {381731#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {381731#true} is VALID [2022-04-08 08:20:58,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {381731#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {381731#true} is VALID [2022-04-08 08:20:58,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {381731#true} assume !(0 != ~p1~0); {381731#true} is VALID [2022-04-08 08:20:58,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {381731#true} assume !(0 != ~p2~0); {381731#true} is VALID [2022-04-08 08:20:58,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {381731#true} assume !(0 != ~p3~0); {381731#true} is VALID [2022-04-08 08:20:58,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {381731#true} assume !(0 != ~p4~0); {381731#true} is VALID [2022-04-08 08:20:58,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {381731#true} assume !(0 != ~p5~0); {381731#true} is VALID [2022-04-08 08:20:58,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {381731#true} assume !(0 != ~p6~0); {381731#true} is VALID [2022-04-08 08:20:58,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {381731#true} assume !(0 != ~p7~0); {381731#true} is VALID [2022-04-08 08:20:58,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {381731#true} assume !(0 != ~p8~0); {381731#true} is VALID [2022-04-08 08:20:58,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {381731#true} assume 0 != ~p9~0;~lk9~0 := 1; {381736#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:58,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:58,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {381736#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {381736#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:58,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {381736#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {381736#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:58,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {381736#(= main_~lk9~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {381736#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:58,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:58,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:58,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:58,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:58,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:58,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:58,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:58,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {381736#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {381736#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:58,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {381736#(= main_~lk9~0 1)} assume 0 != ~p9~0; {381736#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:58,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {381736#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {381732#false} is VALID [2022-04-08 08:20:58,601 INFO L290 TraceCheckUtils]: 31: Hoare triple {381732#false} assume !false; {381732#false} is VALID [2022-04-08 08:20:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:20:58,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:58,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637528432] [2022-04-08 08:20:58,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637528432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:58,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:58,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:58,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:58,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1368375096] [2022-04-08 08:20:58,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1368375096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:58,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:58,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:58,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145419185] [2022-04-08 08:20:58,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:58,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 08:20:58,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:58,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:58,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:58,622 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:58,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:58,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:58,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:58,622 INFO L87 Difference]: Start difference. First operand 9737 states and 14087 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:14,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:21:14,507 INFO L93 Difference]: Finished difference Result 16909 states and 24969 transitions. [2022-04-08 08:21:14,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:21:14,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 08:21:14,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:21:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-08 08:21:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-08 08:21:14,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2022-04-08 08:21:14,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:21:27,906 INFO L225 Difference]: With dead ends: 16909 [2022-04-08 08:21:27,906 INFO L226 Difference]: Without dead ends: 16907 [2022-04-08 08:21:27,909 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:21:27,909 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:21:27,909 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 88 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:21:27,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16907 states. [2022-04-08 08:21:29,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16907 to 14345. [2022-04-08 08:21:29,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:21:29,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16907 states. Second operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:29,168 INFO L74 IsIncluded]: Start isIncluded. First operand 16907 states. Second operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:29,185 INFO L87 Difference]: Start difference. First operand 16907 states. Second operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:38,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:21:38,548 INFO L93 Difference]: Finished difference Result 16907 states and 24712 transitions. [2022-04-08 08:21:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand 16907 states and 24712 transitions. [2022-04-08 08:21:38,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:21:38,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:21:38,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16907 states. [2022-04-08 08:21:38,586 INFO L87 Difference]: Start difference. First operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16907 states. [2022-04-08 08:21:47,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:21:47,426 INFO L93 Difference]: Finished difference Result 16907 states and 24712 transitions. [2022-04-08 08:21:47,426 INFO L276 IsEmpty]: Start isEmpty. Operand 16907 states and 24712 transitions. [2022-04-08 08:21:47,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:21:47,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:21:47,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:21:47,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:21:47,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:58,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 20103 transitions. [2022-04-08 08:21:58,354 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 20103 transitions. Word has length 32 [2022-04-08 08:21:58,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:21:58,354 INFO L478 AbstractCegarLoop]: Abstraction has 14345 states and 20103 transitions. [2022-04-08 08:21:58,354 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:58,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14345 states and 20103 transitions. [2022-04-08 08:22:21,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20103 edges. 20103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:22:21,119 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 20103 transitions. [2022-04-08 08:22:21,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 08:22:21,128 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:22:21,128 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:22:21,128 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 08:22:21,128 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:22:21,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:22:21,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1238618077, now seen corresponding path program 1 times [2022-04-08 08:22:21,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:22:21,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1240299159] [2022-04-08 08:22:21,129 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:22:21,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1238618077, now seen corresponding path program 2 times [2022-04-08 08:22:21,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:22:21,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906628685] [2022-04-08 08:22:21,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:22:21,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:22:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:22:21,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:22:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:22:21,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {478071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {478065#true} is VALID [2022-04-08 08:22:21,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {478065#true} assume true; {478065#true} is VALID [2022-04-08 08:22:21,171 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {478065#true} {478065#true} #251#return; {478065#true} is VALID [2022-04-08 08:22:21,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {478065#true} call ULTIMATE.init(); {478071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:22:21,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {478071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {478065#true} is VALID [2022-04-08 08:22:21,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {478065#true} assume true; {478065#true} is VALID [2022-04-08 08:22:21,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {478065#true} {478065#true} #251#return; {478065#true} is VALID [2022-04-08 08:22:21,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {478065#true} call #t~ret18 := main(); {478065#true} is VALID [2022-04-08 08:22:21,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {478065#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {478065#true} is VALID [2022-04-08 08:22:21,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {478065#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {478065#true} is VALID [2022-04-08 08:22:21,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {478065#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {478065#true} is VALID [2022-04-08 08:22:21,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {478065#true} assume !(0 != ~p1~0); {478065#true} is VALID [2022-04-08 08:22:21,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {478065#true} assume !(0 != ~p2~0); {478065#true} is VALID [2022-04-08 08:22:21,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {478065#true} assume !(0 != ~p3~0); {478065#true} is VALID [2022-04-08 08:22:21,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {478065#true} assume !(0 != ~p4~0); {478065#true} is VALID [2022-04-08 08:22:21,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {478065#true} assume !(0 != ~p5~0); {478065#true} is VALID [2022-04-08 08:22:21,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {478065#true} assume !(0 != ~p6~0); {478065#true} is VALID [2022-04-08 08:22:21,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {478065#true} assume !(0 != ~p7~0); {478065#true} is VALID [2022-04-08 08:22:21,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {478065#true} assume !(0 != ~p8~0); {478065#true} is VALID [2022-04-08 08:22:21,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {478065#true} assume !(0 != ~p9~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-08 08:22:21,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p10~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-08 08:22:21,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {478070#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {478070#(= main_~p9~0 0)} is VALID [2022-04-08 08:22:21,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {478070#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {478070#(= main_~p9~0 0)} is VALID [2022-04-08 08:22:21,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {478070#(= main_~p9~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {478070#(= main_~p9~0 0)} is VALID [2022-04-08 08:22:21,175 INFO L290 TraceCheckUtils]: 21: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p1~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-08 08:22:21,175 INFO L290 TraceCheckUtils]: 22: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p2~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-08 08:22:21,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p3~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-08 08:22:21,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p4~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-08 08:22:21,176 INFO L290 TraceCheckUtils]: 25: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p5~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-08 08:22:21,176 INFO L290 TraceCheckUtils]: 26: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p6~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-08 08:22:21,176 INFO L290 TraceCheckUtils]: 27: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p7~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-08 08:22:21,177 INFO L290 TraceCheckUtils]: 28: Hoare triple {478070#(= main_~p9~0 0)} assume !(0 != ~p8~0); {478070#(= main_~p9~0 0)} is VALID [2022-04-08 08:22:21,177 INFO L290 TraceCheckUtils]: 29: Hoare triple {478070#(= main_~p9~0 0)} assume 0 != ~p9~0; {478066#false} is VALID [2022-04-08 08:22:21,177 INFO L290 TraceCheckUtils]: 30: Hoare triple {478066#false} assume 1 != ~lk9~0; {478066#false} is VALID [2022-04-08 08:22:21,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {478066#false} assume !false; {478066#false} is VALID [2022-04-08 08:22:21,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:22:21,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:22:21,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906628685] [2022-04-08 08:22:21,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906628685] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:22:21,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:22:21,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:22:21,178 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:22:21,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1240299159] [2022-04-08 08:22:21,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1240299159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:22:21,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:22:21,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:22:21,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842697662] [2022-04-08 08:22:21,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:22:21,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 08:22:21,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:22:21,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:22:21,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:22:21,198 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:22:21,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:22:21,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:22:21,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:22:21,199 INFO L87 Difference]: Start difference. First operand 14345 states and 20103 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:23:34,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:23:34,023 INFO L93 Difference]: Finished difference Result 33037 states and 46473 transitions. [2022-04-08 08:23:34,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:23:34,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 08:23:34,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:23:34,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:23:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-08 08:23:34,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:23:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-08 08:23:34,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 222 transitions. [2022-04-08 08:23:34,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:23:49,887 INFO L225 Difference]: With dead ends: 33037 [2022-04-08 08:23:49,887 INFO L226 Difference]: Without dead ends: 18955 [2022-04-08 08:23:49,902 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:23:49,903 INFO L913 BasicCegarLoop]: 128 mSDtfsCounter, 145 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:23:49,903 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 135 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:23:49,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18955 states. [2022-04-08 08:23:51,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18955 to 18953. [2022-04-08 08:23:51,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:23:51,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18955 states. Second operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:23:51,730 INFO L74 IsIncluded]: Start isIncluded. First operand 18955 states. Second operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:23:51,761 INFO L87 Difference]: Start difference. First operand 18955 states. Second operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:24:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:24:03,327 INFO L93 Difference]: Finished difference Result 18955 states and 26376 transitions. [2022-04-08 08:24:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 18955 states and 26376 transitions. [2022-04-08 08:24:03,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:24:03,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:24:03,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18955 states. [2022-04-08 08:24:03,392 INFO L87 Difference]: Start difference. First operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18955 states. [2022-04-08 08:24:13,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:24:13,920 INFO L93 Difference]: Finished difference Result 18955 states and 26376 transitions. [2022-04-08 08:24:13,920 INFO L276 IsEmpty]: Start isEmpty. Operand 18955 states and 26376 transitions. [2022-04-08 08:24:13,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:24:13,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:24:13,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:24:13,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:24:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:24:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18953 states to 18953 states and 26375 transitions. [2022-04-08 08:24:31,204 INFO L78 Accepts]: Start accepts. Automaton has 18953 states and 26375 transitions. Word has length 32 [2022-04-08 08:24:31,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:24:31,204 INFO L478 AbstractCegarLoop]: Abstraction has 18953 states and 26375 transitions. [2022-04-08 08:24:31,204 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:24:31,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18953 states and 26375 transitions. [2022-04-08 08:25:01,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26375 edges. 26375 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:25:01,625 INFO L276 IsEmpty]: Start isEmpty. Operand 18953 states and 26375 transitions. [2022-04-08 08:25:01,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 08:25:01,635 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:25:01,635 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:25:01,635 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 08:25:01,636 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:25:01,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:25:01,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1331017764, now seen corresponding path program 1 times [2022-04-08 08:25:01,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:25:01,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1206596241] [2022-04-08 08:25:01,636 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:25:01,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1331017764, now seen corresponding path program 2 times [2022-04-08 08:25:01,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:25:01,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772265530] [2022-04-08 08:25:01,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:25:01,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:25:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:25:01,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:25:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:25:01,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {619973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {619967#true} is VALID [2022-04-08 08:25:01,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {619967#true} assume true; {619967#true} is VALID [2022-04-08 08:25:01,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {619967#true} {619967#true} #251#return; {619967#true} is VALID [2022-04-08 08:25:01,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {619967#true} call ULTIMATE.init(); {619973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:25:01,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {619973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {619967#true} is VALID [2022-04-08 08:25:01,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {619967#true} assume true; {619967#true} is VALID [2022-04-08 08:25:01,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {619967#true} {619967#true} #251#return; {619967#true} is VALID [2022-04-08 08:25:01,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {619967#true} call #t~ret18 := main(); {619967#true} is VALID [2022-04-08 08:25:01,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {619967#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {619967#true} is VALID [2022-04-08 08:25:01,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {619967#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {619967#true} is VALID [2022-04-08 08:25:01,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {619967#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {619967#true} is VALID [2022-04-08 08:25:01,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {619967#true} assume !(0 != ~p1~0); {619967#true} is VALID [2022-04-08 08:25:01,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {619967#true} assume !(0 != ~p2~0); {619967#true} is VALID [2022-04-08 08:25:01,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {619967#true} assume !(0 != ~p3~0); {619967#true} is VALID [2022-04-08 08:25:01,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {619967#true} assume !(0 != ~p4~0); {619967#true} is VALID [2022-04-08 08:25:01,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {619967#true} assume !(0 != ~p5~0); {619967#true} is VALID [2022-04-08 08:25:01,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {619967#true} assume !(0 != ~p6~0); {619967#true} is VALID [2022-04-08 08:25:01,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {619967#true} assume !(0 != ~p7~0); {619967#true} is VALID [2022-04-08 08:25:01,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {619967#true} assume !(0 != ~p8~0); {619967#true} is VALID [2022-04-08 08:25:01,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {619967#true} assume 0 != ~p9~0;~lk9~0 := 1; {619972#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:25:01,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:25:01,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {619972#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {619972#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:25:01,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {619972#(not (= main_~p9~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {619972#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:25:01,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {619972#(not (= main_~p9~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {619972#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:25:01,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:25:01,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:25:01,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:25:01,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:25:01,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:25:01,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:25:01,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:25:01,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {619972#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:25:01,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {619972#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {619968#false} is VALID [2022-04-08 08:25:01,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {619968#false} assume 0 != ~p10~0; {619968#false} is VALID [2022-04-08 08:25:01,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {619968#false} assume 1 != ~lk10~0; {619968#false} is VALID [2022-04-08 08:25:01,681 INFO L290 TraceCheckUtils]: 32: Hoare triple {619968#false} assume !false; {619968#false} is VALID [2022-04-08 08:25:01,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:25:01,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:25:01,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772265530] [2022-04-08 08:25:01,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772265530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:25:01,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:25:01,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:25:01,681 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:25:01,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1206596241] [2022-04-08 08:25:01,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1206596241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:25:01,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:25:01,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:25:01,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179280162] [2022-04-08 08:25:01,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:25:01,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 08:25:01,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:25:01,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:25:01,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:25:01,701 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:25:01,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:25:01,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:25:01,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:25:01,702 INFO L87 Difference]: Start difference. First operand 18953 states and 26375 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:26:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:26:00,466 INFO L93 Difference]: Finished difference Result 28429 states and 39433 transitions. [2022-04-08 08:26:00,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:26:00,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 08:26:00,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:26:00,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:26:00,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-08 08:26:00,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:26:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-08 08:26:00,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 217 transitions. [2022-04-08 08:26:00,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:26:17,447 INFO L225 Difference]: With dead ends: 28429 [2022-04-08 08:26:17,448 INFO L226 Difference]: Without dead ends: 19211 [2022-04-08 08:26:17,459 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:26:17,460 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 162 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:26:17,460 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 119 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:26:17,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19211 states. [2022-04-08 08:26:19,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19211 to 19209. [2022-04-08 08:26:19,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:26:19,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19211 states. Second operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:26:19,194 INFO L74 IsIncluded]: Start isIncluded. First operand 19211 states. Second operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:26:19,220 INFO L87 Difference]: Start difference. First operand 19211 states. Second operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:26:32,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:26:32,016 INFO L93 Difference]: Finished difference Result 19211 states and 26376 transitions. [2022-04-08 08:26:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 19211 states and 26376 transitions. [2022-04-08 08:26:32,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:26:32,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:26:32,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19211 states. [2022-04-08 08:26:32,143 INFO L87 Difference]: Start difference. First operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19211 states. [2022-04-08 08:26:45,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:26:45,125 INFO L93 Difference]: Finished difference Result 19211 states and 26376 transitions. [2022-04-08 08:26:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 19211 states and 26376 transitions. [2022-04-08 08:26:45,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:26:45,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:26:45,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:26:45,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:26:45,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:27:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19209 states to 19209 states and 26375 transitions. [2022-04-08 08:27:04,968 INFO L78 Accepts]: Start accepts. Automaton has 19209 states and 26375 transitions. Word has length 33 [2022-04-08 08:27:04,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:27:04,968 INFO L478 AbstractCegarLoop]: Abstraction has 19209 states and 26375 transitions. [2022-04-08 08:27:04,968 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:27:04,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19209 states and 26375 transitions. [2022-04-08 08:27:36,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26375 edges. 26375 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:27:36,018 INFO L276 IsEmpty]: Start isEmpty. Operand 19209 states and 26375 transitions. [2022-04-08 08:27:36,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 08:27:36,027 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:27:36,027 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:27:36,027 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-08 08:27:36,027 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:27:36,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:27:36,028 INFO L85 PathProgramCache]: Analyzing trace with hash -257330138, now seen corresponding path program 1 times [2022-04-08 08:27:36,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:27:36,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [319955852] [2022-04-08 08:27:36,028 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:27:36,028 INFO L85 PathProgramCache]: Analyzing trace with hash -257330138, now seen corresponding path program 2 times [2022-04-08 08:27:36,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:27:36,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884623954] [2022-04-08 08:27:36,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:27:36,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:27:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:27:36,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:27:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:27:36,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {753683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {753677#true} is VALID [2022-04-08 08:27:36,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {753677#true} assume true; {753677#true} is VALID [2022-04-08 08:27:36,073 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {753677#true} {753677#true} #251#return; {753677#true} is VALID [2022-04-08 08:27:36,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {753677#true} call ULTIMATE.init(); {753683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:27:36,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {753683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {753677#true} is VALID [2022-04-08 08:27:36,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {753677#true} assume true; {753677#true} is VALID [2022-04-08 08:27:36,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {753677#true} {753677#true} #251#return; {753677#true} is VALID [2022-04-08 08:27:36,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {753677#true} call #t~ret18 := main(); {753677#true} is VALID [2022-04-08 08:27:36,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {753677#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;havoc ~cond~0; {753677#true} is VALID [2022-04-08 08:27:36,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {753677#true} assume !false;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~cond~0 := #t~nondet17;havoc #t~nondet17; {753677#true} is VALID [2022-04-08 08:27:36,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {753677#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0; {753677#true} is VALID [2022-04-08 08:27:36,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {753677#true} assume !(0 != ~p1~0); {753677#true} is VALID [2022-04-08 08:27:36,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {753677#true} assume !(0 != ~p2~0); {753677#true} is VALID [2022-04-08 08:27:36,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {753677#true} assume !(0 != ~p3~0); {753677#true} is VALID [2022-04-08 08:27:36,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {753677#true} assume !(0 != ~p4~0); {753677#true} is VALID [2022-04-08 08:27:36,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {753677#true} assume !(0 != ~p5~0); {753677#true} is VALID [2022-04-08 08:27:36,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {753677#true} assume !(0 != ~p6~0); {753677#true} is VALID [2022-04-08 08:27:36,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {753677#true} assume !(0 != ~p7~0); {753677#true} is VALID [2022-04-08 08:27:36,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {753677#true} assume !(0 != ~p8~0); {753677#true} is VALID [2022-04-08 08:27:36,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {753677#true} assume !(0 != ~p9~0); {753677#true} is VALID [2022-04-08 08:27:36,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {753677#true} assume !(0 != ~p10~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-08 08:27:36,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {753682#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {753682#(= main_~p10~0 0)} is VALID [2022-04-08 08:27:36,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {753682#(= main_~p10~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {753682#(= main_~p10~0 0)} is VALID [2022-04-08 08:27:36,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {753682#(= main_~p10~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {753682#(= main_~p10~0 0)} is VALID [2022-04-08 08:27:36,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p1~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-08 08:27:36,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p2~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-08 08:27:36,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p3~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-08 08:27:36,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p4~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-08 08:27:36,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p5~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-08 08:27:36,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p6~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-08 08:27:36,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p7~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-08 08:27:36,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p8~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-08 08:27:36,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {753682#(= main_~p10~0 0)} assume !(0 != ~p9~0); {753682#(= main_~p10~0 0)} is VALID [2022-04-08 08:27:36,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {753682#(= main_~p10~0 0)} assume 0 != ~p10~0; {753678#false} is VALID [2022-04-08 08:27:36,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {753678#false} assume 1 != ~lk10~0; {753678#false} is VALID [2022-04-08 08:27:36,081 INFO L290 TraceCheckUtils]: 32: Hoare triple {753678#false} assume !false; {753678#false} is VALID [2022-04-08 08:27:36,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:27:36,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:27:36,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884623954] [2022-04-08 08:27:36,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884623954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:27:36,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:27:36,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:27:36,082 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:27:36,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [319955852] [2022-04-08 08:27:36,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [319955852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:27:36,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:27:36,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:27:36,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931743103] [2022-04-08 08:27:36,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:27:36,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 08:27:36,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:27:36,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:27:36,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:27:36,103 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:27:36,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:27:36,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:27:36,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:27:36,104 INFO L87 Difference]: Start difference. First operand 19209 states and 26375 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)