/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/dll2n_update_all.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:20:38,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:20:38,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 16:20:38,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:20:38,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:20:38,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:20:38,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:20:38,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:20:38,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:20:38,905 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:20:38,905 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:20:38,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:20:38,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:20:38,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:20:38,906 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:20:38,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:20:38,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:20:38,907 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:20:38,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:20:38,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:20:38,908 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:20:38,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:20:38,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:20:38,909 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:20:38,909 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:20:38,909 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:20:38,909 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:20:38,909 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:20:38,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:20:38,910 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:20:38,910 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:20:38,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:20:38,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:20:38,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:20:38,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:20:38,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:20:38,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:20:38,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:20:38,911 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:20:38,911 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:20:38,911 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:20:38,911 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:20:38,912 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:20:38,912 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:20:38,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:20:38,912 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:20:38,912 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-12-16 16:20:39,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:20:39,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:20:39,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:20:39,128 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:20:39,128 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:20:39,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_update_all.i [2023-12-16 16:20:40,046 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:20:40,249 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:20:40,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_update_all.i [2023-12-16 16:20:40,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/266b4d534/6f62530b4234419baf26e8cea43d3f9b/FLAGb34817dbe [2023-12-16 16:20:40,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/266b4d534/6f62530b4234419baf26e8cea43d3f9b [2023-12-16 16:20:40,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:20:40,288 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:20:40,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:20:40,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:20:40,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:20:40,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:20:40" (1/1) ... [2023-12-16 16:20:40,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb0e3c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:40, skipping insertion in model container [2023-12-16 16:20:40,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:20:40" (1/1) ... [2023-12-16 16:20:40,337 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:20:40,580 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_update_all.i[24455,24468] [2023-12-16 16:20:40,582 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:20:40,590 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:20:40,635 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_update_all.i[24455,24468] [2023-12-16 16:20:40,636 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:20:40,659 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:20:40,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:40 WrapperNode [2023-12-16 16:20:40,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:20:40,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:20:40,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:20:40,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:20:40,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:40" (1/1) ... [2023-12-16 16:20:40,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:40" (1/1) ... [2023-12-16 16:20:40,717 INFO L138 Inliner]: procedures = 129, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 115 [2023-12-16 16:20:40,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:20:40,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:20:40,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:20:40,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:20:40,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:40" (1/1) ... [2023-12-16 16:20:40,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:40" (1/1) ... [2023-12-16 16:20:40,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:40" (1/1) ... [2023-12-16 16:20:40,756 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2023-12-16 16:20:40,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:40" (1/1) ... [2023-12-16 16:20:40,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:40" (1/1) ... [2023-12-16 16:20:40,762 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:40" (1/1) ... [2023-12-16 16:20:40,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:40" (1/1) ... [2023-12-16 16:20:40,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:40" (1/1) ... [2023-12-16 16:20:40,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:40" (1/1) ... [2023-12-16 16:20:40,771 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:20:40,772 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:20:40,772 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:20:40,772 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:20:40,773 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:40" (1/1) ... [2023-12-16 16:20:40,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:20:40,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:20:40,804 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 16:20:40,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 16:20:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-16 16:20:40,822 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-16 16:20:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 16:20:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 16:20:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 16:20:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:20:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-16 16:20:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-16 16:20:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-16 16:20:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-16 16:20:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 16:20:40,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 16:20:40,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 16:20:40,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:20:40,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 16:20:40,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:20:40,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:20:40,945 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:20:40,948 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:20:40,984 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-16 16:20:41,214 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:20:41,234 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:20:41,234 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-16 16:20:41,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:20:41 BoogieIcfgContainer [2023-12-16 16:20:41,235 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:20:41,236 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:20:41,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:20:41,239 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:20:41,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:20:40" (1/3) ... [2023-12-16 16:20:41,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be19c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:20:41, skipping insertion in model container [2023-12-16 16:20:41,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:40" (2/3) ... [2023-12-16 16:20:41,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be19c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:20:41, skipping insertion in model container [2023-12-16 16:20:41,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:20:41" (3/3) ... [2023-12-16 16:20:41,241 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2023-12-16 16:20:41,253 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:20:41,254 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:20:41,294 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:20:41,300 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6efc1191, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:20:41,300 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:20:41,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 23 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:41,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 16:20:41,309 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:20:41,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:20:41,310 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:20:41,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:20:41,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1931789620, now seen corresponding path program 1 times [2023-12-16 16:20:41,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:20:41,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660662165] [2023-12-16 16:20:41,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:20:41,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:41,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:20:41,330 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:20:41,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 16:20:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:20:41,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 16:20:41,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:41,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:20:41,438 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:20:41,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:20:41,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660662165] [2023-12-16 16:20:41,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660662165] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:20:41,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:20:41,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:20:41,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317324568] [2023-12-16 16:20:41,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:20:41,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 16:20:41,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:20:41,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 16:20:41,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:20:41,473 INFO L87 Difference]: Start difference. First operand has 25 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 23 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:20:41,503 INFO L93 Difference]: Finished difference Result 41 states and 65 transitions. [2023-12-16 16:20:41,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 16:20:41,505 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-16 16:20:41,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:20:41,509 INFO L225 Difference]: With dead ends: 41 [2023-12-16 16:20:41,510 INFO L226 Difference]: Without dead ends: 17 [2023-12-16 16:20:41,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:20:41,515 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:20:41,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:20:41,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-16 16:20:41,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-16 16:20:41,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:41,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2023-12-16 16:20:41,538 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 10 [2023-12-16 16:20:41,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:20:41,539 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2023-12-16 16:20:41,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:41,539 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2023-12-16 16:20:41,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 16:20:41,541 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:20:41,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:20:41,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 16:20:41,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:41,744 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:20:41,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:20:41,745 INFO L85 PathProgramCache]: Analyzing trace with hash 887365988, now seen corresponding path program 1 times [2023-12-16 16:20:41,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:20:41,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752503875] [2023-12-16 16:20:41,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:20:41,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:41,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:20:41,747 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:20:41,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 16:20:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:20:41,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 16:20:41,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:20:41,832 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:20:41,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:20:41,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752503875] [2023-12-16 16:20:41,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752503875] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:20:41,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:20:41,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:20:41,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757921174] [2023-12-16 16:20:41,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:20:41,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:20:41,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:20:41,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:20:41,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:20:41,835 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:20:41,860 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2023-12-16 16:20:41,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:20:41,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-16 16:20:41,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:20:41,861 INFO L225 Difference]: With dead ends: 33 [2023-12-16 16:20:41,861 INFO L226 Difference]: Without dead ends: 22 [2023-12-16 16:20:41,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:20:41,862 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:20:41,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 29 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:20:41,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-16 16:20:41,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2023-12-16 16:20:41,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:41,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2023-12-16 16:20:41,866 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 10 [2023-12-16 16:20:41,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:20:41,866 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2023-12-16 16:20:41,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:41,866 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2023-12-16 16:20:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 16:20:41,867 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:20:41,867 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:20:41,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 16:20:42,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:42,070 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:20:42,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:20:42,070 INFO L85 PathProgramCache]: Analyzing trace with hash 506733128, now seen corresponding path program 1 times [2023-12-16 16:20:42,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:20:42,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901942805] [2023-12-16 16:20:42,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:20:42,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:42,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:20:42,072 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:20:42,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 16:20:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:20:42,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:20:42,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:42,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:20:42,182 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:20:42,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:20:42,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901942805] [2023-12-16 16:20:42,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901942805] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:20:42,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:20:42,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:20:42,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922004081] [2023-12-16 16:20:42,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:20:42,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:20:42,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:20:42,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:20:42,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:20:42,184 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:42,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:20:42,268 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2023-12-16 16:20:42,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:20:42,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-16 16:20:42,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:20:42,269 INFO L225 Difference]: With dead ends: 38 [2023-12-16 16:20:42,269 INFO L226 Difference]: Without dead ends: 22 [2023-12-16 16:20:42,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:20:42,270 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:20:42,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 28 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:20:42,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-16 16:20:42,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2023-12-16 16:20:42,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:42,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-12-16 16:20:42,273 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 15 [2023-12-16 16:20:42,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:20:42,273 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-12-16 16:20:42,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:42,274 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2023-12-16 16:20:42,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 16:20:42,274 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:20:42,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:20:42,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 16:20:42,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:42,475 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:20:42,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:20:42,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1207797706, now seen corresponding path program 1 times [2023-12-16 16:20:42,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:20:42,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140920931] [2023-12-16 16:20:42,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:20:42,476 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:42,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:20:42,477 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:20:42,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 16:20:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:20:42,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:20:42,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:42,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:20:42,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:20:42,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:20:42,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:20:42,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140920931] [2023-12-16 16:20:42,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140920931] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:20:42,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:20:42,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-16 16:20:42,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539065314] [2023-12-16 16:20:42,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:20:42,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:20:42,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:20:42,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:20:42,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:20:42,648 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:42,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:20:42,687 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2023-12-16 16:20:42,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 16:20:42,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-16 16:20:42,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:20:42,688 INFO L225 Difference]: With dead ends: 38 [2023-12-16 16:20:42,688 INFO L226 Difference]: Without dead ends: 27 [2023-12-16 16:20:42,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:20:42,689 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:20:42,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 46 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:20:42,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-16 16:20:42,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2023-12-16 16:20:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:42,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2023-12-16 16:20:42,692 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 15 [2023-12-16 16:20:42,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:20:42,692 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-12-16 16:20:42,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:42,692 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2023-12-16 16:20:42,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-16 16:20:42,693 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:20:42,693 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:20:42,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 16:20:42,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:42,896 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:20:42,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:20:42,897 INFO L85 PathProgramCache]: Analyzing trace with hash -820458590, now seen corresponding path program 1 times [2023-12-16 16:20:42,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:20:42,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955671047] [2023-12-16 16:20:42,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:20:42,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:42,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:20:42,899 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:20:42,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 16:20:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:20:43,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:20:43,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:43,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 16:20:43,051 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:20:43,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:20:43,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955671047] [2023-12-16 16:20:43,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955671047] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:20:43,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:20:43,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 16:20:43,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599231238] [2023-12-16 16:20:43,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:20:43,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:20:43,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:20:43,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:20:43,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:20:43,053 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:43,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:20:43,090 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2023-12-16 16:20:43,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:20:43,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-16 16:20:43,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:20:43,091 INFO L225 Difference]: With dead ends: 39 [2023-12-16 16:20:43,092 INFO L226 Difference]: Without dead ends: 32 [2023-12-16 16:20:43,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:20:43,092 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:20:43,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 27 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:20:43,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-16 16:20:43,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2023-12-16 16:20:43,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:43,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-12-16 16:20:43,096 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 20 [2023-12-16 16:20:43,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:20:43,097 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-12-16 16:20:43,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:43,097 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-12-16 16:20:43,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 16:20:43,097 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:20:43,097 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:20:43,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 16:20:43,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:43,302 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:20:43,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:20:43,303 INFO L85 PathProgramCache]: Analyzing trace with hash 707043052, now seen corresponding path program 1 times [2023-12-16 16:20:43,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:20:43,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925612812] [2023-12-16 16:20:43,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:20:43,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:43,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:20:43,304 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:20:43,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 16:20:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:20:43,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 16:20:43,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:43,435 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 16:20:43,435 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:20:43,495 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 16:20:43,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:20:43,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925612812] [2023-12-16 16:20:43,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925612812] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:20:43,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:20:43,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-16 16:20:43,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024983621] [2023-12-16 16:20:43,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:20:43,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 16:20:43,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:20:43,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 16:20:43,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:20:43,497 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:43,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:20:43,575 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2023-12-16 16:20:43,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:20:43,576 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-16 16:20:43,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:20:43,576 INFO L225 Difference]: With dead ends: 48 [2023-12-16 16:20:43,576 INFO L226 Difference]: Without dead ends: 41 [2023-12-16 16:20:43,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:20:43,577 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 71 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:20:43,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 52 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:20:43,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-16 16:20:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2023-12-16 16:20:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:43,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-12-16 16:20:43,581 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 23 [2023-12-16 16:20:43,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:20:43,581 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-12-16 16:20:43,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:43,581 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-12-16 16:20:43,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 16:20:43,581 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:20:43,581 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:20:43,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 16:20:43,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:43,786 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:20:43,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:20:43,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1329958754, now seen corresponding path program 2 times [2023-12-16 16:20:43,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:20:43,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319676114] [2023-12-16 16:20:43,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:20:43,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:43,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:20:43,787 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:20:43,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 16:20:43,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:20:43,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:20:43,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:20:43,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:43,904 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 16:20:43,905 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:20:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 16:20:43,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:20:43,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319676114] [2023-12-16 16:20:43,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1319676114] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:20:43,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:20:43,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-16 16:20:43,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497836815] [2023-12-16 16:20:43,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:20:43,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 16:20:43,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:20:43,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 16:20:43,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:20:43,936 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:44,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:20:44,079 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2023-12-16 16:20:44,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:20:44,081 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-16 16:20:44,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:20:44,081 INFO L225 Difference]: With dead ends: 56 [2023-12-16 16:20:44,081 INFO L226 Difference]: Without dead ends: 46 [2023-12-16 16:20:44,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-12-16 16:20:44,082 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 65 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:20:44,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 65 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:20:44,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-16 16:20:44,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 28. [2023-12-16 16:20:44,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:44,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-12-16 16:20:44,086 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 26 [2023-12-16 16:20:44,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:20:44,086 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-12-16 16:20:44,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:44,087 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-12-16 16:20:44,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-16 16:20:44,087 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:20:44,087 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:20:44,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 16:20:44,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:44,290 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:20:44,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:20:44,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1493860792, now seen corresponding path program 1 times [2023-12-16 16:20:44,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:20:44,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428972892] [2023-12-16 16:20:44,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:20:44,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:44,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:20:44,292 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:20:44,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 16:20:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:20:44,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-16 16:20:44,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:44,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-16 16:20:44,502 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-16 16:20:44,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-16 16:20:44,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-16 16:20:44,556 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-16 16:20:44,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-16 16:20:44,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 16:20:44,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-16 16:20:44,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-16 16:20:44,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-16 16:20:44,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-16 16:20:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:20:44,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:20:45,015 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_240) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) is different from false [2023-12-16 16:20:45,029 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_240 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_dll_update_at_~head#1.offset| (_ bv4 32))) v_ArrVal_240) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2023-12-16 16:20:45,047 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)) v_ArrVal_240) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) is different from false [2023-12-16 16:20:45,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:20:45,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2023-12-16 16:20:45,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:20:45,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 51 [2023-12-16 16:20:45,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-12-16 16:20:45,129 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_update_at_~head#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (= |c_ULTIMATE.start_main_~s~0#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (forall ((v_ArrVal_238 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_238) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= v_ArrVal_238 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_238 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))))) (= |c_ULTIMATE.start_dll_update_at_~data#1| |c_ULTIMATE.start_main_~len~0#1|)) is different from false [2023-12-16 16:20:45,279 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_236 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_236) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) is different from false [2023-12-16 16:20:45,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:20:45,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2023-12-16 16:20:45,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2023-12-16 16:20:45,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-16 16:20:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-12-16 16:20:45,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:20:45,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428972892] [2023-12-16 16:20:45,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1428972892] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:20:45,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:20:45,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2023-12-16 16:20:45,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149242683] [2023-12-16 16:20:45,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:20:45,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-16 16:20:45,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:20:45,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-16 16:20:45,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=492, Unknown=5, NotChecked=240, Total=812 [2023-12-16 16:20:45,351 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:47,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:20:47,802 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2023-12-16 16:20:47,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 16:20:47,803 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-16 16:20:47,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:20:47,803 INFO L225 Difference]: With dead ends: 59 [2023-12-16 16:20:47,803 INFO L226 Difference]: Without dead ends: 57 [2023-12-16 16:20:47,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=973, Unknown=5, NotChecked=340, Total=1482 [2023-12-16 16:20:47,804 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 85 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 299 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:20:47,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 184 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 456 Invalid, 0 Unknown, 299 Unchecked, 2.0s Time] [2023-12-16 16:20:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-16 16:20:47,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2023-12-16 16:20:47,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:47,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2023-12-16 16:20:47,811 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 27 [2023-12-16 16:20:47,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:20:47,812 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2023-12-16 16:20:47,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:47,812 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2023-12-16 16:20:47,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 16:20:47,812 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:20:47,812 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:20:47,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 16:20:48,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:48,013 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:20:48,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:20:48,014 INFO L85 PathProgramCache]: Analyzing trace with hash -934301861, now seen corresponding path program 1 times [2023-12-16 16:20:48,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:20:48,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653541719] [2023-12-16 16:20:48,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:20:48,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:48,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:20:48,015 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:20:48,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 16:20:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:20:48,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 16:20:48,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-16 16:20:48,164 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:20:48,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:20:48,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653541719] [2023-12-16 16:20:48,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1653541719] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:20:48,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:20:48,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:20:48,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298688040] [2023-12-16 16:20:48,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:20:48,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:20:48,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:20:48,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:20:48,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:20:48,165 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:48,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:20:48,215 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2023-12-16 16:20:48,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:20:48,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-16 16:20:48,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:20:48,216 INFO L225 Difference]: With dead ends: 52 [2023-12-16 16:20:48,216 INFO L226 Difference]: Without dead ends: 46 [2023-12-16 16:20:48,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:20:48,217 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:20:48,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:20:48,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-16 16:20:48,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2023-12-16 16:20:48,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2023-12-16 16:20:48,224 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 28 [2023-12-16 16:20:48,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:20:48,225 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2023-12-16 16:20:48,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:48,225 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2023-12-16 16:20:48,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 16:20:48,225 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:20:48,225 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:20:48,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 16:20:48,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:48,426 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:20:48,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:20:48,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2015110622, now seen corresponding path program 2 times [2023-12-16 16:20:48,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:20:48,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623002618] [2023-12-16 16:20:48,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:20:48,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:48,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:20:48,428 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:20:48,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-16 16:20:48,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:20:48,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:20:48,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:20:48,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:48,556 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 16:20:48,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:20:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 16:20:48,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:20:48,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623002618] [2023-12-16 16:20:48,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623002618] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:20:48,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:20:48,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-16 16:20:48,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643139509] [2023-12-16 16:20:48,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:20:48,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 16:20:48,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:20:48,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 16:20:48,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:20:48,608 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:20:48,749 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2023-12-16 16:20:48,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:20:48,750 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-16 16:20:48,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:20:48,750 INFO L225 Difference]: With dead ends: 68 [2023-12-16 16:20:48,750 INFO L226 Difference]: Without dead ends: 52 [2023-12-16 16:20:48,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-12-16 16:20:48,751 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 35 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:20:48,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 107 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:20:48,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-16 16:20:48,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2023-12-16 16:20:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2023-12-16 16:20:48,759 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 28 [2023-12-16 16:20:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:20:48,759 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2023-12-16 16:20:48,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:48,759 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2023-12-16 16:20:48,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-16 16:20:48,759 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:20:48,759 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:20:48,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-16 16:20:48,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:48,964 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:20:48,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:20:48,965 INFO L85 PathProgramCache]: Analyzing trace with hash 478338447, now seen corresponding path program 1 times [2023-12-16 16:20:48,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:20:48,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119354896] [2023-12-16 16:20:48,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:20:48,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:48,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:20:48,966 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:20:48,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-16 16:20:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:20:49,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:20:49,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-16 16:20:49,096 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:20:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-16 16:20:49,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:20:49,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119354896] [2023-12-16 16:20:49,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119354896] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:20:49,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:20:49,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-16 16:20:49,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990769908] [2023-12-16 16:20:49,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:20:49,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 16:20:49,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:20:49,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 16:20:49,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:20:49,129 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:49,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:20:49,248 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2023-12-16 16:20:49,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:20:49,249 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-16 16:20:49,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:20:49,249 INFO L225 Difference]: With dead ends: 63 [2023-12-16 16:20:49,249 INFO L226 Difference]: Without dead ends: 57 [2023-12-16 16:20:49,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-12-16 16:20:49,250 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 53 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:20:49,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 67 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:20:49,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-16 16:20:49,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2023-12-16 16:20:49,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:49,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2023-12-16 16:20:49,258 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 31 [2023-12-16 16:20:49,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:20:49,258 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2023-12-16 16:20:49,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:20:49,259 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2023-12-16 16:20:49,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 16:20:49,259 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:20:49,259 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:20:49,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-16 16:20:49,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:49,468 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:20:49,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:20:49,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1944243812, now seen corresponding path program 1 times [2023-12-16 16:20:49,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:20:49,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088226891] [2023-12-16 16:20:49,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:20:49,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:49,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:20:49,470 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:20:49,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-16 16:20:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:20:49,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 69 conjunts are in the unsatisfiable core [2023-12-16 16:20:49,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:49,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-16 16:20:49,724 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-16 16:20:49,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-16 16:20:49,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-16 16:20:49,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-12-16 16:20:49,829 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-16 16:20:49,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-12-16 16:20:49,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2023-12-16 16:20:50,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-16 16:20:50,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 16:20:50,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-16 16:20:50,327 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-16 16:20:50,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2023-12-16 16:20:50,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2023-12-16 16:20:50,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2023-12-16 16:20:50,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 16:20:50,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-16 16:20:50,695 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:20:50,696 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:20:50,930 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| |c_ULTIMATE.start_dll_update_at_~data#1|)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)))) is different from false [2023-12-16 16:20:50,959 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd |c_ULTIMATE.start_dll_update_at_~head#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) .cse1)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (select (select (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|) .cse1) |c_ULTIMATE.start_dll_update_at_~data#1|)) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))) (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)))) is different from false [2023-12-16 16:20:50,993 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (select (select (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (bvadd |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|))) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)))) is different from false [2023-12-16 16:20:51,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 946 treesize of output 854 [2023-12-16 16:20:54,949 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse8 (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_460))) (let ((.cse0 (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_dll_update_at_~head#1.offset| .cse0) (= (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse0))))) (not (= v_ArrVal_460 (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))))) (not (= v_ArrVal_461 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))))) (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (not (= v_ArrVal_461 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse5 .cse6 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_460 (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_460))) (= (select (select .cse7 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) (select (select (store .cse7 .cse6 v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))))))) (or .cse8 (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_460)) (.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (let ((.cse9 (select (select (store .cse13 .cse10 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) (.cse12 (select (select (store .cse11 .cse10 v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (not (= v_ArrVal_460 (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (not (= v_ArrVal_461 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (not (= .cse9 .cse10)) (not (= (select (select .cse11 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse12)) (not (= .cse9 |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (not (= |c_ULTIMATE.start_dll_update_at_~head#1.offset| .cse12)))))))) (or .cse8 (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (not (= v_ArrVal_460 (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (not (= v_ArrVal_461 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (not (= (select (select (store .cse14 .cse15 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse15)) (not (let ((.cse16 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_460))) (= (select (select .cse16 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) (select (select (store .cse16 .cse15 v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))))))) (or .cse8 (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_463)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) |c_ULTIMATE.start_dll_update_at_~head#1.base|) (not (= v_ArrVal_461 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|))))))) (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_460 (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (= |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_460) .cse18 v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))) (not (= v_ArrVal_461 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse19 .cse18 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse18)))))) (or .cse8 (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_460 (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (not (= v_ArrVal_461 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (= |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_460) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))) (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_461 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461))) (let ((.cse21 (select (select .cse22 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (let ((.cse20 (select (select (store .cse22 .cse21 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (= .cse20 |c_ULTIMATE.start_dll_update_at_~head#1.base|) (= .cse20 .cse21)))))))) (or (and (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_461 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_460 (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_460))) (= (select (select .cse23 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) (select (select (store .cse23 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_461 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store .cse24 .cse25 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse25)))))) .cse8) (= |c_ULTIMATE.start_dll_update_at_~data#1| (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)))))) is different from false [2023-12-16 16:20:58,960 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse8 (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_460))) (let ((.cse0 (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_dll_update_at_~head#1.offset| .cse0) (= (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse0))))) (not (= v_ArrVal_460 (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))))) (not (= v_ArrVal_461 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))))) (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (not (= v_ArrVal_461 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse5 .cse6 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_460 (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_460))) (= (select (select .cse7 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) (select (select (store .cse7 .cse6 v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))))))) (or .cse8 (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_460)) (.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (let ((.cse9 (select (select (store .cse13 .cse10 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) (.cse12 (select (select (store .cse11 .cse10 v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (not (= v_ArrVal_460 (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (not (= v_ArrVal_461 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (not (= .cse9 .cse10)) (not (= (select (select .cse11 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse12)) (not (= .cse9 |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (not (= |c_ULTIMATE.start_dll_update_at_~head#1.offset| .cse12)))))))) (or .cse8 (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (not (= v_ArrVal_460 (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (not (= v_ArrVal_461 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (not (= (select (select (store .cse14 .cse15 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse15)) (not (let ((.cse16 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_460))) (= (select (select .cse16 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) (select (select (store .cse16 .cse15 v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))))))) (or .cse8 (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_463)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) |c_ULTIMATE.start_dll_update_at_~head#1.base|) (not (= v_ArrVal_461 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|))))))) (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_460 (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (= |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_460) .cse18 v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))) (not (= v_ArrVal_461 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse19 .cse18 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse18)))))) (or .cse8 (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_460 (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (not (= v_ArrVal_461 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (= |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_460) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))) (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_461 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461))) (let ((.cse21 (select (select .cse22 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (let ((.cse20 (select (select (store .cse22 .cse21 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (= .cse20 |c_ULTIMATE.start_dll_update_at_~head#1.base|) (= .cse20 .cse21)))))))) (or (and (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_461 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_460 (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_460))) (= (select (select .cse23 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) (select (select (store .cse23 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_461 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store .cse24 .cse25 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse25)))))) .cse8) (= |c_ULTIMATE.start_dll_update_at_~data#1| (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)))))) is different from true [2023-12-16 16:20:59,797 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse6 (select .cse2 .cse1)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse7 (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_ArrVal_461 .cse1))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_461) .cse0 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (not (= v_ArrVal_461 (store .cse2 |c_ULTIMATE.start_main_~s~0#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select v_ArrVal_461 .cse1))) (or (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_461) .cse3 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (not (= v_ArrVal_461 (store .cse2 |c_ULTIMATE.start_main_~s~0#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_460) .cse3 v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (select v_ArrVal_460 .cse1)) (not (= v_ArrVal_460 (store .cse4 |c_ULTIMATE.start_main_~s~0#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_main_~s~0#1.offset|))))))))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_460) .cse6 v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (or (= .cse5 |c_ULTIMATE.start_main_~s~0#1.offset|) (= .cse5 (select v_ArrVal_460 .cse1)) (not (= v_ArrVal_460 (store .cse4 |c_ULTIMATE.start_main_~s~0#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_main_~s~0#1.offset|))))))) (or (and (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_460) .cse6 v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (select v_ArrVal_460 .cse1)) (not (= v_ArrVal_460 (store .cse4 |c_ULTIMATE.start_main_~s~0#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_main_~s~0#1.offset|)))))) .cse7) (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|)) (or (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_460) .cse6 v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) |c_ULTIMATE.start_main_~s~0#1.offset|) (not (= v_ArrVal_460 (store .cse4 |c_ULTIMATE.start_main_~s~0#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_main_~s~0#1.offset|)))))) .cse7) (or (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_461) (select v_ArrVal_461 .cse1) v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (not (= v_ArrVal_461 (store .cse2 |c_ULTIMATE.start_main_~s~0#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_main_~s~0#1.offset|)))))) .cse7) (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select v_ArrVal_461 .cse1))) (or (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_460) .cse8 v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) |c_ULTIMATE.start_main_~s~0#1.offset|) (not (= v_ArrVal_460 (store .cse4 |c_ULTIMATE.start_main_~s~0#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse8 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_461) .cse8 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (not (= v_ArrVal_461 (store .cse2 |c_ULTIMATE.start_main_~s~0#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_main_~s~0#1.offset|))))))) (or (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select v_ArrVal_461 .cse1))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_460) .cse9 v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_461) .cse9 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (not (= .cse10 |c_ULTIMATE.start_main_~s~0#1.offset|)) (not (= .cse10 (select v_ArrVal_460 .cse1))) (not (= v_ArrVal_460 (store .cse4 |c_ULTIMATE.start_main_~s~0#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_main_~s~0#1.offset|)))) (not (= v_ArrVal_461 (store .cse2 |c_ULTIMATE.start_main_~s~0#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) .cse7) (or (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select v_ArrVal_461 .cse1))) (or (not (= .cse11 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_461) .cse11 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_460) .cse11 v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (select v_ArrVal_460 .cse1))) (not (= v_ArrVal_460 (store .cse4 |c_ULTIMATE.start_main_~s~0#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_main_~s~0#1.offset|)))) (not (= v_ArrVal_461 (store .cse2 |c_ULTIMATE.start_main_~s~0#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_main_~s~0#1.offset|))))))) .cse7)))) is different from false [2023-12-16 16:20:59,954 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) (let ((.cse3 (select .cse5 .cse1)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_460) .cse3 v_ArrVal_462) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1))) (or (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= .cse0 (select v_ArrVal_460 .cse1)) (not (= v_ArrVal_460 (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_create_~head~0#1.offset|))))))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_460) .cse3 v_ArrVal_462) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1) (select v_ArrVal_460 .cse1)) (not (= v_ArrVal_460 (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select v_ArrVal_461 .cse1))) (or (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_461) .cse4 v_ArrVal_463) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1) .cse4)) (not (= v_ArrVal_461 (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_460 (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_460) .cse4 v_ArrVal_462) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select v_ArrVal_461 .cse1))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_461) .cse6 v_ArrVal_463) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1) .cse6))) (not (= v_ArrVal_461 (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select v_ArrVal_461 .cse1))) (or (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_460 (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_460) .cse7 v_ArrVal_462) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1) (select v_ArrVal_460 .cse1)))) (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_461) .cse7 v_ArrVal_463) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= v_ArrVal_461 (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)))))))))) is different from false [2023-12-16 16:21:00,228 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse3 (select .cse5 .cse2))) (and (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_460) .cse3 v_ArrVal_462) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (or (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) v_ArrVal_460)) (= (select v_ArrVal_460 .cse2) .cse0)))) (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select v_ArrVal_461 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_461) .cse4 v_ArrVal_463) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) .cse4))) (not (= v_ArrVal_461 (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select v_ArrVal_461 .cse2))) (or (not (= v_ArrVal_461 (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_461) .cse6 v_ArrVal_463) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select v_ArrVal_460 .cse2) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_460) .cse6 v_ArrVal_462) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) (not (= (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) v_ArrVal_460))))))) (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select v_ArrVal_461 .cse2))) (or (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_461) .cse7 v_ArrVal_463) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) .cse7)) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) v_ArrVal_460)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_460) .cse7 v_ArrVal_462) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)))) (not (= v_ArrVal_461 (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) v_ArrVal_460)) (= (select v_ArrVal_460 .cse2) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_460) .cse3 v_ArrVal_462) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))))))) is different from false [2023-12-16 16:21:00,405 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select v_ArrVal_461 .cse1)) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_457))) (or (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_455))) (or (not (= v_ArrVal_460 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))) (= (select v_ArrVal_460 .cse1) (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_460) .cse2 v_ArrVal_462) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_461) .cse2 v_ArrVal_463) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (not (= v_ArrVal_461 (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (forall ((v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_455))) (let ((.cse4 (select (select (store (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_460) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_462) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (or (= (select v_ArrVal_460 .cse1) .cse4) (not (= v_ArrVal_460 (store (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse4))))) (forall ((v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_455))) (or (= (select v_ArrVal_460 .cse1) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_460) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_462) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) (not (= v_ArrVal_460 (store (select .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (forall ((v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select v_ArrVal_461 .cse1)) (.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_457))) (or (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_455))) (or (not (= v_ArrVal_460 (store (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select (select (store (store .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_460) .cse8 v_ArrVal_462) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_461) .cse8 v_ArrVal_463) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) .cse8)) (not (= v_ArrVal_461 (store (select .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_457))) (or (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select v_ArrVal_461 .cse1))) (= (select (select (store (store .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_461) .cse11 v_ArrVal_463) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) .cse11))) (not (= v_ArrVal_461 (store (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))))) is different from false [2023-12-16 16:21:00,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:21:00,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 62 [2023-12-16 16:21:00,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2023-12-16 16:21:00,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:21:00,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2023-12-16 16:21:00,549 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 16:21:00,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2023-12-16 16:21:00,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 16:21:00,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2023-12-16 16:21:00,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-16 16:21:00,595 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 16:21:00,595 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 16:21:00,598 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 16:21:00,599 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 16:21:00,601 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-16 16:21:00,613 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-16 16:21:00,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 1 [2023-12-16 16:21:00,625 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-12-16 16:21:00,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 1 [2023-12-16 16:21:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2023-12-16 16:21:00,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:21:00,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088226891] [2023-12-16 16:21:00,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088226891] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:21:00,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:21:00,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2023-12-16 16:21:00,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279332297] [2023-12-16 16:21:00,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:21:00,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-16 16:21:00,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:21:00,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-16 16:21:00,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=732, Unknown=9, NotChecked=488, Total=1332 [2023-12-16 16:21:00,849 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 37 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:21:08,732 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse9 (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|))) (and (= (select .cse0 (_ bv8 32)) (_ bv0 32)) (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_460))) (let ((.cse1 (select (select (store .cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_dll_update_at_~head#1.offset| .cse1) (= (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) .cse1))))) (not (= v_ArrVal_460 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))))) (not (= v_ArrVal_461 (store .cse5 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (select .cse0 (_ bv4 32)) (_ bv0 32)) (= |c_ULTIMATE.start_dll_update_at_~head#1.offset| (_ bv0 32)) (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (or (not (= v_ArrVal_461 (store .cse5 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse6 .cse7 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_460 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_460))) (= (select (select .cse8 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) (select (select (store .cse8 .cse7 v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))))))))) (or .cse9 (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461))) (let ((.cse12 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_460)) (.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (let ((.cse10 (select (select (store .cse14 .cse11 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3)) (.cse13 (select (select (store .cse12 .cse11 v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (or (not (= v_ArrVal_460 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (not (= v_ArrVal_461 (store .cse5 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (not (= .cse10 .cse11)) (not (= (select (select .cse12 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) .cse13)) (not (= .cse10 |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (not (= |c_ULTIMATE.start_dll_update_at_~head#1.offset| .cse13)))))))) (or .cse9 (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (or (not (= v_ArrVal_460 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (not (= v_ArrVal_461 (store .cse5 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (not (= (select (select (store .cse15 .cse16 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) .cse16)) (not (let ((.cse17 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_460))) (= (select (select .cse17 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) (select (select (store .cse17 .cse16 v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))))))))) (or .cse9 (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461))) (store .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_463)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) |c_ULTIMATE.start_dll_update_at_~head#1.base|) (not (= v_ArrVal_461 (store .cse5 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|))))))) (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|) (= |c_ULTIMATE.start_main_~s~0#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (or (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_460 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (= |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_460) .cse19 v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3)))) (not (= v_ArrVal_461 (store .cse5 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store .cse20 .cse19 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) .cse19)))))) .cse9 (or .cse9 (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_460 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (not (= v_ArrVal_461 (store .cse5 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (= |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_460) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (_ bv4 32)))) (= (_ bv2 32) |c_ULTIMATE.start_dll_update_at_~data#1|) (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_461 (store .cse5 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (let ((.cse21 (select (select (store .cse23 .cse22 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (or (= .cse21 |c_ULTIMATE.start_dll_update_at_~head#1.base|) (= .cse21 .cse22)))))))) (or (and (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_461 (store .cse5 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_460 (store .cse4 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_460 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_460))) (= (select (select .cse24 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) (select (select (store .cse24 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_462) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_461 (store .cse5 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_461 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_463 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_461))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (= (select (select (store .cse25 .cse26 v_ArrVal_463) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) .cse26)))))) .cse9) (= |c_ULTIMATE.start_dll_update_at_~data#1| (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)))))) is different from true [2023-12-16 16:21:11,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:21:11,156 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2023-12-16 16:21:11,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 16:21:11,157 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-16 16:21:11,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:21:11,157 INFO L225 Difference]: With dead ends: 77 [2023-12-16 16:21:11,157 INFO L226 Difference]: Without dead ends: 75 [2023-12-16 16:21:11,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=218, Invalid=1448, Unknown=10, NotChecked=774, Total=2450 [2023-12-16 16:21:11,159 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 104 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 591 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-16 16:21:11,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 206 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 586 Invalid, 0 Unknown, 591 Unchecked, 3.7s Time] [2023-12-16 16:21:11,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-16 16:21:11,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2023-12-16 16:21:11,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:21:11,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2023-12-16 16:21:11,175 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 32 [2023-12-16 16:21:11,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:21:11,175 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2023-12-16 16:21:11,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:21:11,175 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2023-12-16 16:21:11,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 16:21:11,180 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:21:11,180 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:21:11,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-16 16:21:11,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:11,388 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:21:11,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:21:11,389 INFO L85 PathProgramCache]: Analyzing trace with hash -478685482, now seen corresponding path program 3 times [2023-12-16 16:21:11,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:21:11,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446433356] [2023-12-16 16:21:11,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 16:21:11,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:11,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:21:11,390 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:21:11,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-16 16:21:11,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-16 16:21:11,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:21:11,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 16:21:11,553 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:21:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-16 16:21:11,677 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:21:12,303 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-16 16:21:12,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:21:12,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446433356] [2023-12-16 16:21:12,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446433356] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:21:12,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:21:12,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-16 16:21:12,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812486716] [2023-12-16 16:21:12,303 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:21:12,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 16:21:12,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:21:12,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 16:21:12,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:21:12,304 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:21:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:21:12,536 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2023-12-16 16:21:12,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:21:12,537 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-16 16:21:12,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:21:12,537 INFO L225 Difference]: With dead ends: 59 [2023-12-16 16:21:12,537 INFO L226 Difference]: Without dead ends: 45 [2023-12-16 16:21:12,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:21:12,538 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:21:12,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 60 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:21:12,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-16 16:21:12,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-12-16 16:21:12,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:21:12,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2023-12-16 16:21:12,546 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 32 [2023-12-16 16:21:12,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:21:12,546 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2023-12-16 16:21:12,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:21:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2023-12-16 16:21:12,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-16 16:21:12,547 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:21:12,547 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:21:12,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-16 16:21:12,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:12,751 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:21:12,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:21:12,752 INFO L85 PathProgramCache]: Analyzing trace with hash 142669871, now seen corresponding path program 2 times [2023-12-16 16:21:12,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:21:12,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197560300] [2023-12-16 16:21:12,752 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:21:12,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:12,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:21:12,753 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:21:12,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-16 16:21:12,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:21:12,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:21:12,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:21:12,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:21:12,946 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-16 16:21:12,946 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:21:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-16 16:21:13,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:21:13,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197560300] [2023-12-16 16:21:13,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197560300] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:21:13,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:21:13,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-16 16:21:13,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328933724] [2023-12-16 16:21:13,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:21:13,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 16:21:13,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:21:13,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 16:21:13,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:21:13,072 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:21:13,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:21:13,398 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2023-12-16 16:21:13,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:21:13,398 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-12-16 16:21:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:21:13,399 INFO L225 Difference]: With dead ends: 61 [2023-12-16 16:21:13,399 INFO L226 Difference]: Without dead ends: 54 [2023-12-16 16:21:13,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-12-16 16:21:13,399 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:21:13,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 89 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 16:21:13,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-16 16:21:13,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2023-12-16 16:21:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:21:13,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2023-12-16 16:21:13,409 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 33 [2023-12-16 16:21:13,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:21:13,409 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2023-12-16 16:21:13,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:21:13,409 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2023-12-16 16:21:13,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 16:21:13,409 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:21:13,409 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:21:13,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-16 16:21:13,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:13,614 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:21:13,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:21:13,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1224650472, now seen corresponding path program 3 times [2023-12-16 16:21:13,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:21:13,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966783032] [2023-12-16 16:21:13,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 16:21:13,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:13,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:21:13,615 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:21:13,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-16 16:21:13,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-16 16:21:13,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:21:13,811 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 16:21:13,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:21:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 16:21:13,975 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:21:14,241 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-16 16:21:14,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:21:14,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966783032] [2023-12-16 16:21:14,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966783032] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:21:14,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:21:14,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2023-12-16 16:21:14,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530356458] [2023-12-16 16:21:14,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:21:14,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 16:21:14,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:21:14,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 16:21:14,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-12-16 16:21:14,243 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:21:14,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:21:14,472 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2023-12-16 16:21:14,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:21:14,472 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-12-16 16:21:14,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:21:14,472 INFO L225 Difference]: With dead ends: 51 [2023-12-16 16:21:14,472 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 16:21:14,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-12-16 16:21:14,473 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:21:14,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 81 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:21:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 16:21:14,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 16:21:14,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:21:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 16:21:14,474 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2023-12-16 16:21:14,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:21:14,474 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 16:21:14,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:21:14,474 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 16:21:14,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 16:21:14,476 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:21:14,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-16 16:21:14,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:14,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 16:21:17,181 INFO L899 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2023-12-16 16:21:17,182 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 572 574) the Hoare annotation is: true [2023-12-16 16:21:17,182 INFO L899 garLoopResultBuilder]: For program point myexitEXIT(lines 572 574) no Hoare annotation was computed. [2023-12-16 16:21:17,182 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 591) no Hoare annotation was computed. [2023-12-16 16:21:17,182 INFO L899 garLoopResultBuilder]: For program point L589-1(lines 589 591) no Hoare annotation was computed. [2023-12-16 16:21:17,182 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 624 643) no Hoare annotation was computed. [2023-12-16 16:21:17,182 INFO L902 garLoopResultBuilder]: At program point L590(line 590) the Hoare annotation is: true [2023-12-16 16:21:17,182 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 16:21:17,182 INFO L895 garLoopResultBuilder]: At program point L633-3(lines 633 638) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse1 (= (_ bv2 32) (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)))) (.cse2 (= (select .cse6 (_ bv4 32)) (_ bv0 32))) (.cse3 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32))) (.cse4 (= (select (select |#memory_int#1| (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv4 32))) (_ bv0 32)) (_ bv3 32))) (.cse0 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse5 (= (select .cse6 (_ bv8 32)) (_ bv0 32)))) (or (and (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) .cse0) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5)))) [2023-12-16 16:21:17,182 INFO L899 garLoopResultBuilder]: For program point L633-4(lines 633 638) no Hoare annotation was computed. [2023-12-16 16:21:17,182 INFO L895 garLoopResultBuilder]: At program point L618-2(lines 618 621) the Hoare annotation is: (let ((.cse12 (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|)) (.cse11 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv4 32)))) (let ((.cse3 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse11))) (.cse1 (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32))) (.cse2 (= |ULTIMATE.start_dll_update_at_~head#1.offset| (_ bv0 32))) (.cse10 (= (_ bv0 32) |ULTIMATE.start_dll_update_at_~index#1|)) (.cse4 (= (_ bv2 32) (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)))) (.cse5 (= (select .cse12 (_ bv4 32)) (_ bv0 32))) (.cse0 (= |ULTIMATE.start_dll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse6 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32))) (.cse7 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse8 (= (select .cse12 (_ bv8 32)) (_ bv0 32))) (.cse9 (= |ULTIMATE.start_dll_update_at_~data#1| (_ bv3 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (_ bv1 32) |ULTIMATE.start_dll_update_at_~index#1|) .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse10 (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) .cse5 .cse6 .cse7 .cse8 (= (_ bv2 32) |ULTIMATE.start_dll_update_at_~data#1|)) (and .cse1 .cse2 .cse10 .cse4 .cse5 (not .cse0) .cse6 (= |ULTIMATE.start_dll_update_at_~head#1.base| .cse11) .cse7 .cse8 .cse9)))) [2023-12-16 16:21:17,182 INFO L899 garLoopResultBuilder]: For program point L618-3(lines 618 621) no Hoare annotation was computed. [2023-12-16 16:21:17,182 INFO L899 garLoopResultBuilder]: For program point L635(lines 635 637) no Hoare annotation was computed. [2023-12-16 16:21:17,182 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 641) no Hoare annotation was computed. [2023-12-16 16:21:17,183 INFO L895 garLoopResultBuilder]: At program point L611-2(lines 611 614) the Hoare annotation is: (let ((.cse12 (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse1 (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32))) (.cse5 (= |ULTIMATE.start_main_~expected~0#1| (_ bv3 32))) (.cse2 (= |ULTIMATE.start_dll_get_data_at_~head#1.offset| (_ bv0 32))) (.cse3 (= (_ bv2 32) (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)))) (.cse4 (= (select .cse12 (_ bv4 32)) (_ bv0 32))) (.cse8 (select (select |#memory_int#1| |ULTIMATE.start_dll_get_data_at_~head#1.base|) (_ bv0 32))) (.cse6 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32))) (.cse7 (= (select (select |#memory_int#1| (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv4 32))) (_ bv0 32)) (_ bv3 32))) (.cse9 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse10 (= (select .cse12 (_ bv8 32)) (_ bv0 32))) (.cse11 (= |ULTIMATE.start_dll_get_data_at_~index#1| (_ bv0 32)))) (or (let ((.cse0 (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_get_data_at_~head#1.base|))) (and (= (select .cse0 (_ bv8 32)) (_ bv0 32)) .cse1 (= (select .cse0 (_ bv4 32)) (_ bv0 32)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= .cse8 (_ bv2 32)) (= (select (select |#memory_int#1| (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_dll_get_data_at_~head#1.base|) (_ bv4 32))) (_ bv0 32)) (_ bv3 32)) (= |ULTIMATE.start_dll_get_data_at_~index#1| (_ bv1 32)) .cse9 .cse10)) (and .cse1 .cse2 .cse3 .cse4 (= .cse8 (_ bv3 32)) .cse5 .cse6 .cse7 .cse9 .cse10 .cse11) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~expected~0#1| .cse8) .cse6 .cse7 .cse9 .cse10 .cse11)))) [2023-12-16 16:21:17,183 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 16:21:17,183 INFO L899 garLoopResultBuilder]: For program point L611-3(lines 611 614) no Hoare annotation was computed. [2023-12-16 16:21:17,183 INFO L899 garLoopResultBuilder]: For program point L603(lines 603 609) no Hoare annotation was computed. [2023-12-16 16:21:17,183 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 597) no Hoare annotation was computed. [2023-12-16 16:21:17,183 INFO L899 garLoopResultBuilder]: For program point L595-2(lines 595 597) no Hoare annotation was computed. [2023-12-16 16:21:17,183 INFO L895 garLoopResultBuilder]: At program point L587-2(lines 587 600) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|)) (.cse1 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse2 (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))))) (or (let ((.cse3 (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_create_~head~0#1.base|))) (and .cse0 .cse1 .cse2 (not (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv4 32)) |ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse3 (_ bv4 32)) (_ bv0 32)) (= (select .cse3 (_ bv8 32)) (_ bv0 32)))) (and .cse0 (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_dll_create_~len#1|) .cse1) (and .cse0 (= |ULTIMATE.start_dll_create_~len#1| (_ bv1 32)) .cse1 .cse2))) [2023-12-16 16:21:17,183 INFO L899 garLoopResultBuilder]: For program point L587-3(lines 587 600) no Hoare annotation was computed. [2023-12-16 16:21:17,183 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2023-12-16 16:21:17,183 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 624 643) no Hoare annotation was computed. [2023-12-16 16:21:17,183 INFO L895 garLoopResultBuilder]: At program point L629-3(lines 629 632) the Hoare annotation is: (let ((.cse7 (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|)) (.cse6 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv4 32)))) (let ((.cse1 (= (_ bv2 32) (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)))) (.cse0 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse6))) (.cse2 (= (select .cse7 (_ bv4 32)) (_ bv0 32))) (.cse3 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32))) (.cse4 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse5 (= (select .cse7 (_ bv8 32)) (_ bv0 32)))) (or (and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse3 (= (select (select |#memory_int#1| .cse6) (_ bv0 32)) (_ bv3 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) .cse4 .cse5) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) .cse2 .cse3 .cse4 .cse5)))) [2023-12-16 16:21:17,183 INFO L899 garLoopResultBuilder]: For program point L629-4(lines 629 632) no Hoare annotation was computed. [2023-12-16 16:21:17,185 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:21:17,187 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:21:17,194 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0bv32] could not be translated [2023-12-16 16:21:17,194 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4bv32] could not be translated [2023-12-16 16:21:17,195 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4bv32]][0bv32] could not be translated [2023-12-16 16:21:17,195 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][8bv32] could not be translated [2023-12-16 16:21:17,195 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0bv32] could not be translated [2023-12-16 16:21:17,195 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4bv32] could not be translated [2023-12-16 16:21:17,195 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4bv32]][0bv32] could not be translated [2023-12-16 16:21:17,195 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][8bv32] could not be translated [2023-12-16 16:21:17,200 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][8bv32] could not be translated [2023-12-16 16:21:17,200 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][4bv32] could not be translated [2023-12-16 16:21:17,200 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-16 16:21:17,200 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0bv32] could not be translated [2023-12-16 16:21:17,201 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4bv32] could not be translated [2023-12-16 16:21:17,201 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4bv32]][0bv32] could not be translated [2023-12-16 16:21:17,201 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][0bv32] could not be translated [2023-12-16 16:21:17,201 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~head!base][4bv32]][0bv32] could not be translated [2023-12-16 16:21:17,201 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][8bv32] could not be translated [2023-12-16 16:21:17,202 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-16 16:21:17,202 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0bv32] could not be translated [2023-12-16 16:21:17,202 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4bv32] could not be translated [2023-12-16 16:21:17,202 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][0bv32] could not be translated [2023-12-16 16:21:17,202 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4bv32]][0bv32] could not be translated [2023-12-16 16:21:17,202 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][8bv32] could not be translated [2023-12-16 16:21:17,202 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-16 16:21:17,202 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0bv32] could not be translated [2023-12-16 16:21:17,203 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4bv32] could not be translated [2023-12-16 16:21:17,203 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][0bv32] could not be translated [2023-12-16 16:21:17,203 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4bv32]][0bv32] could not be translated [2023-12-16 16:21:17,203 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][8bv32] could not be translated [2023-12-16 16:21:17,204 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-16 16:21:17,204 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4bv32] could not be translated [2023-12-16 16:21:17,204 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4bv32] could not be translated [2023-12-16 16:21:17,205 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][8bv32] could not be translated [2023-12-16 16:21:17,208 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-16 16:21:17,209 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4bv32] could not be translated [2023-12-16 16:21:17,209 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0bv32] could not be translated [2023-12-16 16:21:17,209 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4bv32] could not be translated [2023-12-16 16:21:17,209 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][8bv32] could not be translated [2023-12-16 16:21:17,209 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0bv32] could not be translated [2023-12-16 16:21:17,210 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4bv32] could not be translated [2023-12-16 16:21:17,210 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4bv32]][0bv32] could not be translated [2023-12-16 16:21:17,210 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][8bv32] could not be translated [2023-12-16 16:21:17,210 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4bv32] could not be translated [2023-12-16 16:21:17,210 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4bv32] could not be translated [2023-12-16 16:21:17,211 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][8bv32] could not be translated [2023-12-16 16:21:17,214 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-16 16:21:17,214 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-16 16:21:17,214 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4bv32] could not be translated [2023-12-16 16:21:17,215 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0bv32] could not be translated [2023-12-16 16:21:17,215 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4bv32] could not be translated [2023-12-16 16:21:17,215 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][8bv32] could not be translated [2023-12-16 16:21:17,215 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-16 16:21:17,215 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-16 16:21:17,215 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4bv32] could not be translated [2023-12-16 16:21:17,215 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4bv32] could not be translated [2023-12-16 16:21:17,216 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][8bv32] could not be translated [2023-12-16 16:21:17,216 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-16 16:21:17,216 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0bv32] could not be translated [2023-12-16 16:21:17,219 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4bv32] could not be translated [2023-12-16 16:21:17,219 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-16 16:21:17,219 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-16 16:21:17,219 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4bv32] could not be translated [2023-12-16 16:21:17,219 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][8bv32] could not be translated [2023-12-16 16:21:17,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:21:17 BoogieIcfgContainer [2023-12-16 16:21:17,221 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:21:17,221 INFO L158 Benchmark]: Toolchain (without parser) took 36933.48ms. Allocated memory was 242.2MB in the beginning and 307.2MB in the end (delta: 65.0MB). Free memory was 200.1MB in the beginning and 225.1MB in the end (delta: -25.0MB). Peak memory consumption was 165.3MB. Max. memory is 8.0GB. [2023-12-16 16:21:17,222 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 199.2MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:21:17,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.80ms. Allocated memory is still 242.2MB. Free memory was 200.1MB in the beginning and 180.7MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-16 16:21:17,222 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.37ms. Allocated memory is still 242.2MB. Free memory was 180.7MB in the beginning and 178.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:21:17,222 INFO L158 Benchmark]: Boogie Preprocessor took 53.81ms. Allocated memory is still 242.2MB. Free memory was 178.6MB in the beginning and 175.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 16:21:17,222 INFO L158 Benchmark]: RCFGBuilder took 462.88ms. Allocated memory is still 242.2MB. Free memory was 175.4MB in the beginning and 156.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-16 16:21:17,225 INFO L158 Benchmark]: TraceAbstraction took 35984.19ms. Allocated memory was 242.2MB in the beginning and 307.2MB in the end (delta: 65.0MB). Free memory was 156.0MB in the beginning and 225.1MB in the end (delta: -69.0MB). Peak memory consumption was 121.3MB. Max. memory is 8.0GB. [2023-12-16 16:21:17,227 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43ms. Allocated memory is still 199.2MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 370.80ms. Allocated memory is still 242.2MB. Free memory was 200.1MB in the beginning and 180.7MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.37ms. Allocated memory is still 242.2MB. Free memory was 180.7MB in the beginning and 178.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.81ms. Allocated memory is still 242.2MB. Free memory was 178.6MB in the beginning and 175.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 462.88ms. Allocated memory is still 242.2MB. Free memory was 175.4MB in the beginning and 156.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 35984.19ms. Allocated memory was 242.2MB in the beginning and 307.2MB in the end (delta: 65.0MB). Free memory was 156.0MB in the beginning and 225.1MB in the end (delta: -69.0MB). Peak memory consumption was 121.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4bv32]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][8bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4bv32]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][8bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][8bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4bv32]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~head!base][4bv32]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][8bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4bv32]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][8bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4bv32]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][8bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][8bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][8bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4bv32]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][8bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][8bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][8bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][8bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][8bv32] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 641]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.9s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 516 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 516 mSDsluCounter, 1107 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 890 IncrementalHoareTripleChecker+Unchecked, 872 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1588 IncrementalHoareTripleChecker+Invalid, 2542 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 235 mSDtfsCounter, 1588 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 678 GetRequests, 505 SyntacticMatches, 9 SemanticMatches, 164 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 16.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=12, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 123 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 24 NumberOfFragments, 620 HoareAnnotationTreeSize, 8 FormulaSimplifications, 14676 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FormulaSimplificationsInter, 420 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 366 NumberOfCodeBlocks, 364 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 624 ConstructedInterpolants, 40 QuantifiedInterpolants, 6538 SizeOfPredicates, 67 NumberOfNonLiveVariables, 2113 ConjunctsInSsa, 177 ConjunctsInUnsatCore, 25 InterpolantComputations, 5 PerfectInterpolantSequences, 254/375 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 633]: Loop Invariant Derived loop invariant: ((((i == 2) && (2 == len)) || ((i == 1) && (2 == len))) || ((i == 0) && (2 == len))) - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: (((index == 1) || (index == 0)) || (index == 0)) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: (((2 == len) || ((2 == len) && (2 == len))) || ((len == 1) && (2 == len))) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: ((((i == 1) && (2 == len)) || ((i == 2) && (2 == len))) || ((i == 0) && (2 == len))) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: ((((1 == index) && (data == 3)) || ((0 == index) && (2 == data))) || ((0 == index) && (data == 3))) RESULT: Ultimate proved your program to be correct! [2023-12-16 16:21:17,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...