/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-ext3-properties/dll_circular_traversal-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 21:52:46,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 21:52:46,843 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-24 21:52:46,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 21:52:46,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 21:52:46,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 21:52:46,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 21:52:46,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 21:52:46,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 21:52:46,880 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 21:52:46,880 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 21:52:46,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 21:52:46,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 21:52:46,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 21:52:46,882 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 21:52:46,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 21:52:46,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 21:52:46,883 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 21:52:46,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 21:52:46,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 21:52:46,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 21:52:46,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 21:52:46,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 21:52:46,884 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 21:52:46,884 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 21:52:46,884 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 21:52:46,884 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 21:52:46,884 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 21:52:46,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 21:52:46,885 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 21:52:46,885 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 21:52:46,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 21:52:46,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 21:52:46,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 21:52:46,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:52:46,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 21:52:46,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 21:52:46,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 21:52:46,886 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 21:52:46,886 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 21:52:46,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 21:52:46,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 21:52:46,887 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 21:52:46,887 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 21:52:46,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 21:52:46,887 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 21:52:46,887 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-24 21:52:47,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 21:52:47,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 21:52:47,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 21:52:47,088 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 21:52:47,089 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 21:52:47,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/dll_circular_traversal-2.i [2023-12-24 21:52:48,150 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 21:52:48,327 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 21:52:48,327 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_circular_traversal-2.i [2023-12-24 21:52:48,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d873c78f9/8d8e120b511549fdbd276866e33a958e/FLAG4342a2acd [2023-12-24 21:52:48,353 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d873c78f9/8d8e120b511549fdbd276866e33a958e [2023-12-24 21:52:48,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 21:52:48,356 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 21:52:48,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 21:52:48,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 21:52:48,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 21:52:48,360 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:52:48" (1/1) ... [2023-12-24 21:52:48,361 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51cf6bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:48, skipping insertion in model container [2023-12-24 21:52:48,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:52:48" (1/1) ... [2023-12-24 21:52:48,402 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:52:48,597 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-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2023-12-24 21:52:48,600 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:52:48,608 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 21:52:48,645 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-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2023-12-24 21:52:48,645 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:52:48,669 INFO L206 MainTranslator]: Completed translation [2023-12-24 21:52:48,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:48 WrapperNode [2023-12-24 21:52:48,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 21:52:48,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 21:52:48,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 21:52:48,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 21:52:48,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:48" (1/1) ... [2023-12-24 21:52:48,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:48" (1/1) ... [2023-12-24 21:52:48,698 INFO L138 Inliner]: procedures = 125, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 94 [2023-12-24 21:52:48,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 21:52:48,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 21:52:48,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 21:52:48,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 21:52:48,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:48" (1/1) ... [2023-12-24 21:52:48,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:48" (1/1) ... [2023-12-24 21:52:48,709 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:48" (1/1) ... [2023-12-24 21:52:48,720 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2023-12-24 21:52:48,720 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:48" (1/1) ... [2023-12-24 21:52:48,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:48" (1/1) ... [2023-12-24 21:52:48,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:48" (1/1) ... [2023-12-24 21:52:48,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:48" (1/1) ... [2023-12-24 21:52:48,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:48" (1/1) ... [2023-12-24 21:52:48,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:48" (1/1) ... [2023-12-24 21:52:48,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 21:52:48,747 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 21:52:48,747 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 21:52:48,747 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 21:52:48,748 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:48" (1/1) ... [2023-12-24 21:52:48,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:52:48,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 21:52:48,767 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-24 21:52:48,768 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-24 21:52:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-24 21:52:48,787 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-24 21:52:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 21:52:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 21:52:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 21:52:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 21:52:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 21:52:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 21:52:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 21:52:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 21:52:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 21:52:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 21:52:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 21:52:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 21:52:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 21:52:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 21:52:48,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 21:52:48,884 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 21:52:48,885 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 21:52:48,920 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-24 21:52:49,128 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 21:52:49,146 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 21:52:49,147 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-24 21:52:49,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:52:49 BoogieIcfgContainer [2023-12-24 21:52:49,147 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 21:52:49,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 21:52:49,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 21:52:49,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 21:52:49,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:52:48" (1/3) ... [2023-12-24 21:52:49,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b99f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:52:49, skipping insertion in model container [2023-12-24 21:52:49,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:52:48" (2/3) ... [2023-12-24 21:52:49,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b99f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:52:49, skipping insertion in model container [2023-12-24 21:52:49,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:52:49" (3/3) ... [2023-12-24 21:52:49,152 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2023-12-24 21:52:49,164 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 21:52:49,164 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 21:52:49,191 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 21:52:49,195 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;@6296b98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 21:52:49,195 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 21:52:49,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:52:49,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-24 21:52:49,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:52:49,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:52:49,203 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:52:49,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:52:49,207 INFO L85 PathProgramCache]: Analyzing trace with hash 352116253, now seen corresponding path program 1 times [2023-12-24 21:52:49,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:52:49,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615884031] [2023-12-24 21:52:49,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:52:49,219 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-24 21:52:49,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:52:49,221 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-24 21:52:49,246 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-24 21:52:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:52:49,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 21:52:49,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:52:49,370 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-24 21:52:49,371 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:52:49,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:52:49,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615884031] [2023-12-24 21:52:49,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615884031] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:52:49,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:52:49,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:52:49,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285760118] [2023-12-24 21:52:49,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:52:49,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 21:52:49,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:52:49,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 21:52:49,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:52:49,412 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-24 21:52:49,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:52:49,470 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2023-12-24 21:52:49,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 21:52:49,471 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2023-12-24 21:52:49,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:52:49,475 INFO L225 Difference]: With dead ends: 36 [2023-12-24 21:52:49,475 INFO L226 Difference]: Without dead ends: 16 [2023-12-24 21:52:49,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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-24 21:52:49,479 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:52:49,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:52:49,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-24 21:52:49,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-24 21:52:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-24 21:52:49,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-12-24 21:52:49,498 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 8 [2023-12-24 21:52:49,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:52:49,498 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-12-24 21:52:49,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-24 21:52:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2023-12-24 21:52:49,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-24 21:52:49,499 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:52:49,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:52:49,502 INFO L552 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)] Ended with exit code 0 [2023-12-24 21:52:49,702 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-24 21:52:49,703 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:52:49,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:52:49,703 INFO L85 PathProgramCache]: Analyzing trace with hash 341034001, now seen corresponding path program 1 times [2023-12-24 21:52:49,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:52:49,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817916287] [2023-12-24 21:52:49,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:52:49,704 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-24 21:52:49,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:52:49,705 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-24 21:52:49,707 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-24 21:52:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:52:49,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:52:49,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:52:49,826 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-24 21:52:49,826 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:52:49,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:52:49,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817916287] [2023-12-24 21:52:49,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817916287] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:52:49,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:52:49,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:52:49,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070394247] [2023-12-24 21:52:49,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:52:49,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:52:49,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:52:49,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:52:49,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:52:49,828 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-24 21:52:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:52:49,953 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2023-12-24 21:52:49,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:52:49,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2023-12-24 21:52:49,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:52:49,956 INFO L225 Difference]: With dead ends: 29 [2023-12-24 21:52:49,956 INFO L226 Difference]: Without dead ends: 19 [2023-12-24 21:52:49,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-24 21:52:49,957 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:52:49,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 27 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:52:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-24 21:52:49,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2023-12-24 21:52:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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-24 21:52:49,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2023-12-24 21:52:49,966 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 8 [2023-12-24 21:52:49,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:52:49,966 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2023-12-24 21:52:49,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-24 21:52:49,966 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2023-12-24 21:52:49,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-24 21:52:49,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:52:49,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:52:49,972 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-24 21:52:50,167 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-24 21:52:50,167 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:52:50,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:52:50,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1981597321, now seen corresponding path program 1 times [2023-12-24 21:52:50,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:52:50,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354294600] [2023-12-24 21:52:50,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:52:50,168 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-24 21:52:50,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:52:50,169 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-24 21:52:50,171 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-24 21:52:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:52:50,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 21:52:50,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:52:50,303 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-24 21:52:50,303 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:52:50,338 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-24 21:52:50,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:52:50,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354294600] [2023-12-24 21:52:50,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354294600] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:52:50,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:52:50,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-24 21:52:50,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224155036] [2023-12-24 21:52:50,343 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:52:50,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 21:52:50,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:52:50,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 21:52:50,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:52:50,344 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-24 21:52:50,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:52:50,626 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2023-12-24 21:52:50,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 21:52:50,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 11 [2023-12-24 21:52:50,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:52:50,630 INFO L225 Difference]: With dead ends: 36 [2023-12-24 21:52:50,630 INFO L226 Difference]: Without dead ends: 26 [2023-12-24 21:52:50,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-24 21:52:50,631 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 21:52:50,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 43 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 21:52:50,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-24 21:52:50,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-24 21:52:50,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 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-24 21:52:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-24 21:52:50,637 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 11 [2023-12-24 21:52:50,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:52:50,637 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-24 21:52:50,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-24 21:52:50,637 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-24 21:52:50,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-24 21:52:50,637 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:52:50,637 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:52:50,641 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-24 21:52:50,838 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-24 21:52:50,838 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:52:50,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:52:50,839 INFO L85 PathProgramCache]: Analyzing trace with hash 971283985, now seen corresponding path program 2 times [2023-12-24 21:52:50,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:52:50,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171514617] [2023-12-24 21:52:50,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:52:50,839 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-24 21:52:50,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:52:50,840 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-24 21:52:50,842 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-24 21:52:51,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:52:51,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:52:51,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-24 21:52:51,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:52:51,209 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-24 21:52:51,289 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 21:52:51,289 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-24 21:52:51,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 16 [2023-12-24 21:52:51,364 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-24 21:52:51,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2023-12-24 21:52:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-24 21:52:51,457 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:52:51,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:52:51,554 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 39 treesize of output 32 [2023-12-24 21:52:51,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:52:51,578 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 146 treesize of output 144 [2023-12-24 21:52:51,588 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 154 treesize of output 146 [2023-12-24 21:52:51,684 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 39 treesize of output 33 [2023-12-24 21:52:55,906 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-24 21:52:55,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:52:55,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171514617] [2023-12-24 21:52:55,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171514617] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:52:55,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:52:55,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-24 21:52:55,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051296568] [2023-12-24 21:52:55,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:52:55,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-24 21:52:55,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:52:55,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-24 21:52:55,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=197, Unknown=1, NotChecked=0, Total=240 [2023-12-24 21:52:55,908 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 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-24 21:52:57,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:52:57,397 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2023-12-24 21:52:57,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 21:52:57,398 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 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) Word has length 20 [2023-12-24 21:52:57,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:52:57,398 INFO L225 Difference]: With dead ends: 30 [2023-12-24 21:52:57,398 INFO L226 Difference]: Without dead ends: 28 [2023-12-24 21:52:57,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=98, Invalid=363, Unknown=1, NotChecked=0, Total=462 [2023-12-24 21:52:57,399 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-24 21:52:57,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 74 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-24 21:52:57,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-24 21:52:57,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-24 21:52:57,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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-24 21:52:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-12-24 21:52:57,403 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20 [2023-12-24 21:52:57,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:52:57,403 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-12-24 21:52:57,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 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-24 21:52:57,404 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-12-24 21:52:57,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-24 21:52:57,404 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:52:57,404 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:52:57,424 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-24 21:52:57,610 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-24 21:52:57,610 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:52:57,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:52:57,611 INFO L85 PathProgramCache]: Analyzing trace with hash 327668085, now seen corresponding path program 1 times [2023-12-24 21:52:57,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:52:57,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293355190] [2023-12-24 21:52:57,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:52:57,611 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-24 21:52:57,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:52:57,612 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-24 21:52:57,613 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-24 21:52:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:52:57,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-24 21:52:57,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:52:57,942 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-24 21:52:57,973 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-24 21:52:57,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 20 [2023-12-24 21:52:58,030 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:52:58,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:52:58,125 INFO L349 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-12-24 21:52:58,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-12-24 21:52:58,227 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 0 case distinctions, treesize of input 16 treesize of output 16 [2023-12-24 21:52:58,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-24 21:52:58,333 INFO L349 Elim1Store]: treesize reduction 18, result has 41.9 percent of original size [2023-12-24 21:52:58,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 31 [2023-12-24 21:52:58,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-12-24 21:52:58,444 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 0 case distinctions, treesize of input 27 treesize of output 31 [2023-12-24 21:52:58,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:52:58,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2023-12-24 21:52:58,470 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:52:58,471 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2023-12-24 21:52:58,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-24 21:52:58,490 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-12-24 21:52:58,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:52:58,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2023-12-24 21:52:58,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:52:58,577 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 46 treesize of output 39 [2023-12-24 21:52:58,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-12-24 21:52:58,588 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2023-12-24 21:52:58,607 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-12-24 21:52:58,664 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 35 treesize of output 19 [2023-12-24 21:52:58,669 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 27 treesize of output 15 [2023-12-24 21:52:58,673 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-24 21:52:58,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-24 21:52:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:52:58,727 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:52:58,778 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_347) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0))) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2023-12-24 21:52:58,796 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_347) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_337) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0))))) is different from false [2023-12-24 21:52:58,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:52:58,829 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 66 treesize of output 72 [2023-12-24 21:52:58,840 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 444 treesize of output 426 [2023-12-24 21:52:58,858 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 101 treesize of output 97 [2023-12-24 21:52:58,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:52:58,877 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 202 treesize of output 168 [2023-12-24 21:52:58,886 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 1040 treesize of output 986 [2023-12-24 21:52:58,899 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 51 treesize of output 47 [2023-12-24 21:52:58,910 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 62 treesize of output 54 [2023-12-24 21:52:58,918 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 54 treesize of output 46 [2023-12-24 21:52:59,229 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse2 (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)))) (and (or .cse0 (and (forall ((v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_330) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_347))) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse1 v_arrayElimCell_34) v_arrayElimCell_36))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= v_ArrVal_330 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_331) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_330 .cse2)))))) (or (forall ((v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_330 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_331) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_330 .cse2)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_330) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_347) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) .cse3))) (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_330) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_347) v_arrayElimCell_37) v_arrayElimCell_38)) (not (= v_ArrVal_330 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_331) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_330 .cse2)))))) (not .cse0)) (or (not .cse3) (and (or .cse0 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_330) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_347) v_arrayElimCell_34) v_arrayElimCell_36)) (not (= v_ArrVal_330 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_331) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_330 .cse2))))))) (forall ((v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_330) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_347))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse4 v_arrayElimCell_34) v_arrayElimCell_36)) (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse4 v_arrayElimCell_37) v_arrayElimCell_38)))))) (not (= v_ArrVal_330 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_331) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_330 .cse2)))))))) (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_330) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_347))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse5 v_arrayElimCell_37) v_arrayElimCell_38)) (not (= v_ArrVal_330 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_331) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_330 .cse2)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) .cse3) (forall ((v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_330) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_347))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse6 v_arrayElimCell_37) v_arrayElimCell_38)) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse6 v_arrayElimCell_34) v_arrayElimCell_36))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= v_ArrVal_330 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_331) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_330 .cse2)))))))) is different from false [2023-12-24 21:53:01,210 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:53:01,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:01,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 49 [2023-12-24 21:53:01,218 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 5 treesize of output 3 [2023-12-24 21:53:01,222 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:53:01,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 47 treesize of output 43 [2023-12-24 21:53:01,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:01,233 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 36 treesize of output 40 [2023-12-24 21:53:01,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:01,254 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 34 treesize of output 41 [2023-12-24 21:53:01,265 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 12 treesize of output 8 [2023-12-24 21:53:01,272 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 23 treesize of output 17 [2023-12-24 21:53:01,281 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 21 treesize of output 17 [2023-12-24 21:53:01,298 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:53:01,369 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-12-24 21:53:01,369 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 1974 treesize of output 1960 [2023-12-24 21:53:01,433 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:53:01,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:01,454 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 1 case distinctions, treesize of input 335 treesize of output 333 [2023-12-24 21:53:01,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:01,489 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 327 treesize of output 327 [2023-12-24 21:53:01,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:01,525 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 305 treesize of output 303 [2023-12-24 21:53:01,543 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 288 treesize of output 272 [2023-12-24 21:53:01,857 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 5 treesize of output 3 [2023-12-24 21:53:02,337 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 21 treesize of output 17 [2023-12-24 21:53:02,423 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-12-24 21:53:02,424 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 2 case distinctions, treesize of input 1096 treesize of output 1098 [2023-12-24 21:53:02,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:02,463 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 252 treesize of output 240 [2023-12-24 21:53:02,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:02,510 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 338 treesize of output 336 [2023-12-24 21:53:02,533 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 283 treesize of output 275 [2023-12-24 21:53:02,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:02,573 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 340 treesize of output 340 [2023-12-24 21:53:02,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:02,618 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 145 treesize of output 143 [2023-12-24 21:53:03,821 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 5 treesize of output 3 [2023-12-24 21:53:04,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:04,873 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 457 treesize of output 433 [2023-12-24 21:53:05,399 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-24 21:53:05,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:05,423 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 345 treesize of output 344 [2023-12-24 21:53:05,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:05,444 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 162 treesize of output 162 [2023-12-24 21:53:05,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:05,466 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 207 treesize of output 199 [2023-12-24 21:53:05,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:05,490 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 98 treesize of output 102 [2023-12-24 21:53:05,714 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:53:05,960 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2023-12-24 21:53:05,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2931 treesize of output 2930 [2023-12-24 21:53:06,006 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:53:06,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:06,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 520 treesize of output 528 [2023-12-24 21:53:06,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:06,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 514 treesize of output 524 [2023-12-24 21:53:06,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:06,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 419 treesize of output 425 [2023-12-24 21:53:06,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:06,270 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 575 treesize of output 551 [2023-12-24 21:53:06,474 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 6 treesize of output 4 [2023-12-24 21:53:09,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:09,061 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 149 treesize of output 153 [2023-12-24 21:53:22,609 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 21 treesize of output 17 [2023-12-24 21:53:22,677 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-12-24 21:53:22,678 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 2 case distinctions, treesize of input 141 treesize of output 155 [2023-12-24 21:53:22,694 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 108 treesize of output 100 [2023-12-24 21:53:22,704 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:53:22,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:22,718 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 180 treesize of output 180 [2023-12-24 21:53:22,727 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 174 treesize of output 168 [2023-12-24 21:53:22,751 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 6 treesize of output 4 [2023-12-24 21:53:22,919 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 6 treesize of output 4 [2023-12-24 21:53:49,948 WARN L854 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_main_~data_init~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_28| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_29| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_26| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_27| (_ BitVec 32))) (let ((.cse1 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_29| (_ bv1 1)))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_28| (_ bv1 1)))) (or (not (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_27| (_ bv1 1)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_26|))) (not (= (select .cse1 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_28|) (_ bv0 1))) (not (= (select .cse0 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_27|) (_ bv0 1)))))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_28| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_29| (_ BitVec 32))) (let ((.cse3 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_29| (_ bv1 1)))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_28| (_ bv1 1)))) (or (not (= (select .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (_ bv0 1))) (not (= (select .cse3 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_28|) (_ bv0 1))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_26| (_ BitVec 32))) (not (= (_ bv0 1) (select (store .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (_ bv1 1)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_26|)))))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_28| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_29| (_ BitVec 32))) (let ((.cse4 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_29| (_ bv1 1)))) (or (not (= (select .cse4 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_28|) (_ bv0 1))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_27| (_ BitVec 32))) (let ((.cse5 (store .cse4 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_28| (_ bv1 1)))) (or (not (= (select (store .cse5 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_27| (_ bv1 1)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (_ bv0 1))) (not (= (select .cse5 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_27|) (_ bv0 1)))))))))) is different from false [2023-12-24 21:53:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2023-12-24 21:53:50,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:53:50,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293355190] [2023-12-24 21:53:50,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [293355190] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:53:50,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:53:50,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-24 21:53:50,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038140563] [2023-12-24 21:53:50,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:53:50,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-24 21:53:50,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:53:50,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-24 21:53:50,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=312, Unknown=13, NotChecked=156, Total=552 [2023-12-24 21:53:50,032 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 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-24 21:54:00,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 21:54:04,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 21:54:07,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 21:54:12,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 21:54:12,900 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse4 (not .cse3)) (.cse5 (not .cse0)) (.cse2 (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)))) (and (or .cse0 (and (forall ((v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_330) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_347))) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse1 v_arrayElimCell_34) v_arrayElimCell_36))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= v_ArrVal_330 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_331) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_330 .cse2)))))) (or (forall ((v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_330 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_331) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_330 .cse2)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_330) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_347) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) .cse3))) (= (_ bv0 1) (bvadd (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1))) .cse4 (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_330) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_347) v_arrayElimCell_37) v_arrayElimCell_38)) (not (= v_ArrVal_330 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_331) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_330 .cse2)))))) .cse5) (or .cse4 (and (or .cse0 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_330) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_347) v_arrayElimCell_34) v_arrayElimCell_36)) (not (= v_ArrVal_330 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_331) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_330 .cse2))))))) (forall ((v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_330) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_347))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse6 v_arrayElimCell_34) v_arrayElimCell_36)) (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse6 v_arrayElimCell_37) v_arrayElimCell_38)))))) (not (= v_ArrVal_330 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_331) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_330 .cse2)))))))) (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_330) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_347))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse7 v_arrayElimCell_37) v_arrayElimCell_38)) (not (= v_ArrVal_330 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_331) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_330 .cse2)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) .cse3) (= (_ bv0 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~data#1| (_ bv1 32)) .cse5 (= (_ bv0 1) (bvadd (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (_ bv1 1))) (= |c_ULTIMATE.start_main_~data_init~0#1| (_ bv1 32)) (forall ((v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_330) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_347))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse8 v_arrayElimCell_37) v_arrayElimCell_38)) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse8 v_arrayElimCell_34) v_arrayElimCell_36))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= v_ArrVal_330 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_331) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_330 .cse2))))))))) is different from false [2023-12-24 21:54:18,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-24 21:54:21,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:54:21,890 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2023-12-24 21:54:21,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 21:54:21,890 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 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-24 21:54:21,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:54:21,891 INFO L225 Difference]: With dead ends: 34 [2023-12-24 21:54:21,891 INFO L226 Difference]: Without dead ends: 32 [2023-12-24 21:54:21,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 37.5s TimeCoverageRelationStatistics Valid=179, Invalid=689, Unknown=22, NotChecked=300, Total=1190 [2023-12-24 21:54:21,892 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 12 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 5 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 23.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:54:21,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 81 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 219 Invalid, 12 Unknown, 130 Unchecked, 23.0s Time] [2023-12-24 21:54:21,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-24 21:54:21,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-12-24 21:54:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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-24 21:54:21,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-12-24 21:54:21,897 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 23 [2023-12-24 21:54:21,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:54:21,897 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-12-24 21:54:21,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 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-24 21:54:21,897 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-12-24 21:54:21,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-24 21:54:21,898 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:54:21,898 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:54:21,904 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-24 21:54:22,104 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-24 21:54:22,105 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:54:22,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:54:22,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1566390886, now seen corresponding path program 1 times [2023-12-24 21:54:22,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:54:22,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406305659] [2023-12-24 21:54:22,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:54:22,106 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-24 21:54:22,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:54:22,107 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-24 21:54:22,107 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-24 21:54:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:54:22,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-24 21:54:22,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:54:22,388 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-24 21:54:22,418 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-24 21:54:22,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 20 [2023-12-24 21:54:22,449 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-24 21:54:22,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 20 [2023-12-24 21:54:22,482 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-24 21:54:22,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 20 [2023-12-24 21:54:22,539 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-12-24 21:54:22,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-12-24 21:54:22,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2023-12-24 21:54:22,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 1 [2023-12-24 21:54:22,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:54:22,617 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 24 [2023-12-24 21:54:22,630 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2023-12-24 21:54:22,683 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-24 21:54:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-24 21:54:22,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:54:22,807 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 151 treesize of output 149 [2023-12-24 21:54:22,816 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 62 treesize of output 58 [2023-12-24 21:54:22,831 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-24 21:54:22,836 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-24 21:54:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 4 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-24 21:54:22,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:54:22,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406305659] [2023-12-24 21:54:22,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406305659] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:54:22,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:54:22,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2023-12-24 21:54:22,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958183809] [2023-12-24 21:54:22,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:54:22,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 21:54:22,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:54:22,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 21:54:22,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=103, Unknown=3, NotChecked=0, Total=132 [2023-12-24 21:54:22,938 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 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-24 21:54:24,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:54:24,236 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2023-12-24 21:54:24,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 21:54:24,236 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 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 24 [2023-12-24 21:54:24,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:54:24,237 INFO L225 Difference]: With dead ends: 37 [2023-12-24 21:54:24,237 INFO L226 Difference]: Without dead ends: 31 [2023-12-24 21:54:24,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=157, Unknown=3, NotChecked=0, Total=210 [2023-12-24 21:54:24,237 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:54:24,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 53 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-24 21:54:24,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-24 21:54:24,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-24 21:54:24,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 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-24 21:54:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2023-12-24 21:54:24,242 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 24 [2023-12-24 21:54:24,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:54:24,242 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2023-12-24 21:54:24,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 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-24 21:54:24,242 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2023-12-24 21:54:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-24 21:54:24,243 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:54:24,243 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:54:24,249 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-24 21:54:24,444 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-24 21:54:24,444 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:54:24,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:54:24,444 INFO L85 PathProgramCache]: Analyzing trace with hash -899599471, now seen corresponding path program 2 times [2023-12-24 21:54:24,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:54:24,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156151971] [2023-12-24 21:54:24,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:54:24,445 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-24 21:54:24,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:54:24,446 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-24 21:54:24,466 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-24 21:54:24,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:54:24,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:54:24,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 79 conjunts are in the unsatisfiable core [2023-12-24 21:54:24,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:54:24,908 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-24 21:54:24,968 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:54:24,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:54:25,082 INFO L349 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-12-24 21:54:25,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-12-24 21:54:25,214 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 0 case distinctions, treesize of input 16 treesize of output 16 [2023-12-24 21:54:25,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-24 21:54:25,370 INFO L349 Elim1Store]: treesize reduction 66, result has 34.0 percent of original size [2023-12-24 21:54:25,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 59 [2023-12-24 21:54:25,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:54:25,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2023-12-24 21:54:25,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-12-24 21:54:25,643 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:54:25,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 80 [2023-12-24 21:54:25,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-12-24 21:54:25,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 21:54:25,706 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-12-24 21:54:25,907 INFO L349 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2023-12-24 21:54:25,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 44 [2023-12-24 21:54:26,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:54:26,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2023-12-24 21:54:26,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 21:54:26,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:54:26,166 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 79 treesize of output 58 [2023-12-24 21:54:26,187 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2023-12-24 21:54:26,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-12-24 21:54:26,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 46 [2023-12-24 21:54:26,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-24 21:54:26,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:54:26,520 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2023-12-24 21:54:26,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 86 [2023-12-24 21:54:26,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:54:26,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:54:26,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2023-12-24 21:54:26,555 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-12-24 21:54:26,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2023-12-24 21:54:26,575 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 56 [2023-12-24 21:54:26,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-12-24 21:54:26,835 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:54:26,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 57 [2023-12-24 21:54:26,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:54:26,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2023-12-24 21:54:27,182 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:54:27,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 105 [2023-12-24 21:54:27,203 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-24 21:54:27,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 73 [2023-12-24 21:54:27,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2023-12-24 21:54:27,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-24 21:54:27,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-24 21:54:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:54:27,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:54:29,155 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32))) (.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_610 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_608 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_607 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_607)) (.cse3 (select v_ArrVal_615 .cse6)) (.cse4 (bvadd (_ bv4 32) (select v_ArrVal_616 .cse6)))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_608)) (.cse0 (select (select (store .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_616) .cse3) .cse4))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| .cse0) (not (= v_ArrVal_615 (store (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_615 .cse2)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select v_ArrVal_615 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_610) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_617) .cse3 v_ArrVal_620) (select (select (store .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_615) .cse3) .cse4)) .cse0)) (not (= v_ArrVal_616 (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_616 .cse2)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select v_ArrVal_616 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))))) (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_610 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_608 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_607 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_608)) (.cse9 (select v_ArrVal_615 .cse6)) (.cse11 (bvadd (_ bv4 32) (select v_ArrVal_616 .cse6)))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_615) .cse9) .cse11)) (.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_607))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse7) (not (= v_ArrVal_615 (store (store (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_615 .cse2)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select v_ArrVal_615 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_610) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_617) .cse9 v_ArrVal_620) .cse7) (select (select (store .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_616) .cse9) .cse11))) (not (= v_ArrVal_616 (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_616 .cse2)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select v_ArrVal_616 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))))))) is different from false [2023-12-24 21:54:32,997 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse0 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse6 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse9 (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32))) (.cse11 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_603 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_606 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_606 (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_606 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_610 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_608 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_607 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_602 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_606))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_603)) (.cse8 (store (select .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (select v_ArrVal_615 .cse10)) (.cse4 (bvadd (_ bv4 32) (select v_ArrVal_616 .cse10)))) (let ((.cse2 (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_608) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_615) .cse1) .cse4)) (.cse3 (store (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_602) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_610) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_617) .cse1 v_ArrVal_620) .cse2) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse3) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_607) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_616) .cse1) .cse4))) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_ArrVal_616 (store (store (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse3) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_607) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse6 (select v_ArrVal_616 .cse6)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_616 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (not (= (store (store (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_608) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse6 (select v_ArrVal_615 .cse6)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_615 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_615))))))))) (not (= v_ArrVal_603 (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_603 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (forall ((v_ArrVal_603 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_606 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_606 (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_606 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_610 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_608 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_607 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_602 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_603))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_606)) (.cse17 (store (select .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse13 (select v_ArrVal_615 .cse10)) (.cse15 (bvadd (_ bv4 32) (select v_ArrVal_616 .cse10)))) (let ((.cse12 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse17) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_607) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_616) .cse13) .cse15)) (.cse14 (store (select .cse18 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (= .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_602) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_610) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_617) .cse13 v_ArrVal_620) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse14) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_608) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_615) .cse13) .cse15)) .cse12)) (not (= v_ArrVal_616 (store (store (select (store (store .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse17) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_607) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse6 (select v_ArrVal_616 .cse6)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_616 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (not (= (store (store (select (store (store .cse18 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse14) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_608) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse6 (select v_ArrVal_615 .cse6)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_615 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_615))))))))) (not (= v_ArrVal_603 (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_603 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))))) is different from false [2023-12-24 21:54:39,584 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (bvadd |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv8 32)))) (and (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42|) (_ bv0 1))) (forall ((v_ArrVal_603 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_606 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_610 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_608 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_607 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_602 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42| v_ArrVal_606))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42| v_ArrVal_603)) (.cse6 (store (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse7 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42|)) (.cse3 (select v_ArrVal_615 (_ bv4 32))) (.cse4 (bvadd (_ bv4 32) (select v_ArrVal_616 (_ bv4 32))))) (let ((.cse0 (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse6) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_608) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42| v_ArrVal_615) .cse3) .cse4)) (.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse7 (_ bv0 32)))) (or (= .cse0 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42|) (not (= v_ArrVal_616 (store (store (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_607) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42|) (_ bv8 32) (select v_ArrVal_616 (_ bv8 32))) (_ bv0 32) (select v_ArrVal_616 (_ bv0 32))))) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_602) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_610) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42| v_ArrVal_617) .cse3 v_ArrVal_620) .cse0) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_607) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42| v_ArrVal_616) .cse3) .cse4)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (store (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse6) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_608) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42|) (_ bv8 32) (select v_ArrVal_615 (_ bv8 32))) (_ bv0 32) (select v_ArrVal_615 (_ bv0 32))) v_ArrVal_615))))))) (not (= v_ArrVal_606 (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42|) (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv0 32) (select v_ArrVal_606 (_ bv0 32))))))) (not (= v_ArrVal_603 (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42|) (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (_ bv0 32) (select v_ArrVal_603 (_ bv0 32))))))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42| (_ BitVec 32))) (or (forall ((v_ArrVal_603 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_606 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_606 (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42|) (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv0 32) (select v_ArrVal_606 (_ bv0 32))))) (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_610 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_608 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_607 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_602 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42| v_ArrVal_603))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42| v_ArrVal_606)) (.cse9 (store (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse7 (_ bv0 32))) (.cse11 (select v_ArrVal_615 (_ bv4 32))) (.cse13 (bvadd (_ bv4 32) (select v_ArrVal_616 (_ bv4 32))))) (let ((.cse10 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse9) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_607) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42| v_ArrVal_616) .cse11) .cse13)) (.cse12 (store (select .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse7 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42|))) (or (not (= v_ArrVal_616 (store (store (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse9) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_607) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42|) (_ bv8 32) (select v_ArrVal_616 (_ bv8 32))) (_ bv0 32) (select v_ArrVal_616 (_ bv0 32))))) (= .cse10 (_ bv0 32)) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_602) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_610) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42| v_ArrVal_617) .cse11 v_ArrVal_620) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse12) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_608) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42| v_ArrVal_615) .cse11) .cse13)) .cse10) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (store (select (store (store .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse12) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_608) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42|) (_ bv8 32) (select v_ArrVal_615 (_ bv8 32))) (_ bv0 32) (select v_ArrVal_615 (_ bv0 32))) v_ArrVal_615))))))))) (not (= v_ArrVal_603 (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42|) (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (_ bv0 32) (select v_ArrVal_603 (_ bv0 32))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_42|) (_ bv0 1))))))) is different from false [2023-12-24 22:01:09,849 WARN L293 SmtUtils]: Spent 6.50m on a formula simplification. DAG size of input: 70 DAG size of output: 58 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-24 22:01:09,849 INFO L349 Elim1Store]: treesize reduction 134, result has 48.1 percent of original size [2023-12-24 22:01:09,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22609 treesize of output 21732 [2023-12-24 22:01:54,809 WARN L293 SmtUtils]: Spent 44.87s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-24 22:01:54,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:01:54,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 5264 treesize of output 5330 [2023-12-24 22:02:12,307 WARN L293 SmtUtils]: Spent 17.17s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-24 22:02:12,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:02:12,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1334644 treesize of output 1331852 [2023-12-24 22:02:21,267 WARN L293 SmtUtils]: Spent 8.48s on a formula simplification. DAG size of input: 82 DAG size of output: 50 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-24 22:02:21,267 INFO L349 Elim1Store]: treesize reduction 226, result has 28.7 percent of original size [2023-12-24 22:02:21,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 4837 treesize of output 4872 [2023-12-24 22:02:32,030 WARN L293 SmtUtils]: Spent 10.55s on a formula simplification. DAG size of input: 82 DAG size of output: 50 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-24 22:02:32,030 INFO L349 Elim1Store]: treesize reduction 226, result has 28.7 percent of original size [2023-12-24 22:02:32,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 5149 treesize of output 5144 [2023-12-24 22:02:34,694 INFO L349 Elim1Store]: treesize reduction 46, result has 47.7 percent of original size [2023-12-24 22:02:34,695 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 3 case distinctions, treesize of input 4669 treesize of output 4643 [2023-12-24 22:02:36,050 INFO L349 Elim1Store]: treesize reduction 46, result has 47.7 percent of original size [2023-12-24 22:02:36,051 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 3 case distinctions, treesize of input 4601 treesize of output 4579 [2023-12-24 22:02:37,126 INFO L349 Elim1Store]: treesize reduction 46, result has 47.7 percent of original size [2023-12-24 22:02:37,136 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 3 case distinctions, treesize of input 4537 treesize of output 4535 [2023-12-24 22:02:38,627 INFO L349 Elim1Store]: treesize reduction 46, result has 47.7 percent of original size [2023-12-24 22:02:38,628 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 3 case distinctions, treesize of input 4493 treesize of output 4447 Received shutdown request... [2023-12-24 22:07:26,156 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 22:07:26,162 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 22:07:26,169 WARN L340 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)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 22:07:26,171 INFO L552 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)] Ended with exit code 0 [2023-12-24 22:07:26,363 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-24 22:07:26,364 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-24-3-13-3-10-2-8-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-82-3-13-3-10-2-6-2-2-2-2-2-2-1 context. [2023-12-24 22:07:26,368 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2023-12-24 22:07:26,370 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 22:07:26,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 10:07:26 BoogieIcfgContainer [2023-12-24 22:07:26,372 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 22:07:26,372 INFO L158 Benchmark]: Toolchain (without parser) took 878016.26ms. Allocated memory was 331.4MB in the beginning and 574.6MB in the end (delta: 243.3MB). Free memory was 284.5MB in the beginning and 452.5MB in the end (delta: -168.0MB). Peak memory consumption was 345.0MB. Max. memory is 8.0GB. [2023-12-24 22:07:26,372 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 235.9MB. Free memory was 184.6MB in the beginning and 184.4MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 22:07:26,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.36ms. Allocated memory is still 331.4MB. Free memory was 284.2MB in the beginning and 265.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-24 22:07:26,374 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.75ms. Allocated memory is still 331.4MB. Free memory was 265.3MB in the beginning and 263.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 22:07:26,374 INFO L158 Benchmark]: Boogie Preprocessor took 47.98ms. Allocated memory is still 331.4MB. Free memory was 263.2MB in the beginning and 260.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 22:07:26,374 INFO L158 Benchmark]: RCFGBuilder took 399.96ms. Allocated memory is still 331.4MB. Free memory was 260.5MB in the beginning and 242.7MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-24 22:07:26,375 INFO L158 Benchmark]: TraceAbstraction took 877223.22ms. Allocated memory was 331.4MB in the beginning and 574.6MB in the end (delta: 243.3MB). Free memory was 241.9MB in the beginning and 452.5MB in the end (delta: -210.5MB). Peak memory consumption was 302.0MB. Max. memory is 8.0GB. [2023-12-24 22:07:26,376 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.13ms. Allocated memory is still 235.9MB. Free memory was 184.6MB in the beginning and 184.4MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 313.36ms. Allocated memory is still 331.4MB. Free memory was 284.2MB in the beginning and 265.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.75ms. Allocated memory is still 331.4MB. Free memory was 265.3MB in the beginning and 263.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.98ms. Allocated memory is still 331.4MB. Free memory was 263.2MB in the beginning and 260.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 399.96ms. Allocated memory is still 331.4MB. Free memory was 260.5MB in the beginning and 242.7MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 877223.22ms. Allocated memory was 331.4MB in the beginning and 574.6MB in the end (delta: 243.3MB). Free memory was 241.9MB in the beginning and 452.5MB in the end (delta: -210.5MB). Peak memory consumption was 302.0MB. Max. memory is 8.0GB. * 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 - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 626). Cancelled while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-24-3-13-3-10-2-8-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-82-3-13-3-10-2-6-2-2-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 877.2s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 35.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 26.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 303 SdHoareTripleChecker+Invalid, 25.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 130 IncrementalHoareTripleChecker+Unchecked, 220 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 485 IncrementalHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 83 mSDtfsCounter, 485 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 105 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 42.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=5, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 57.6s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 162 ConstructedInterpolants, 26 QuantifiedInterpolants, 3735 SizeOfPredicates, 37 NumberOfNonLiveVariables, 944 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 61/138 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown