/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/sll_circular_traversal-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 21:53:31,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 21:53:31,627 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:53:31,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 21:53:31,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 21:53:31,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 21:53:31,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 21:53:31,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 21:53:31,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 21:53:31,658 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 21:53:31,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 21:53:31,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 21:53:31,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 21:53:31,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 21:53:31,660 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 21:53:31,660 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 21:53:31,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 21:53:31,661 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 21:53:31,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 21:53:31,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 21:53:31,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 21:53:31,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 21:53:31,662 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 21:53:31,662 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 21:53:31,663 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 21:53:31,663 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 21:53:31,663 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 21:53:31,663 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 21:53:31,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 21:53:31,663 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 21:53:31,664 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 21:53:31,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 21:53:31,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 21:53:31,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 21:53:31,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:53:31,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 21:53:31,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 21:53:31,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 21:53:31,665 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 21:53:31,665 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 21:53:31,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 21:53:31,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 21:53:31,666 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 21:53:31,666 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 21:53:31,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 21:53:31,666 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 21:53:31,666 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:53:31,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 21:53:31,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 21:53:31,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 21:53:31,869 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 21:53:31,869 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 21:53:31,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_circular_traversal-1.i [2023-12-24 21:53:32,929 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 21:53:33,152 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 21:53:33,156 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_circular_traversal-1.i [2023-12-24 21:53:33,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f125b82a/c6e9d67d43774eb1b39fb0222675bb11/FLAG12dcb2614 [2023-12-24 21:53:33,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f125b82a/c6e9d67d43774eb1b39fb0222675bb11 [2023-12-24 21:53:33,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 21:53:33,191 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 21:53:33,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 21:53:33,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 21:53:33,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 21:53:33,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:53:33" (1/1) ... [2023-12-24 21:53:33,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b0601e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:53:33, skipping insertion in model container [2023-12-24 21:53:33,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:53:33" (1/1) ... [2023-12-24 21:53:33,233 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:53:33,418 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/sll_circular_traversal-1.i[24132,24145] [2023-12-24 21:53:33,422 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:53:33,435 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 21:53:33,463 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/sll_circular_traversal-1.i[24132,24145] [2023-12-24 21:53:33,464 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:53:33,484 INFO L206 MainTranslator]: Completed translation [2023-12-24 21:53:33,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:53:33 WrapperNode [2023-12-24 21:53:33,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 21:53:33,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 21:53:33,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 21:53:33,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 21:53:33,490 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:53:33" (1/1) ... [2023-12-24 21:53:33,501 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:53:33" (1/1) ... [2023-12-24 21:53:33,521 INFO L138 Inliner]: procedures = 125, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 89 [2023-12-24 21:53:33,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 21:53:33,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 21:53:33,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 21:53:33,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 21:53:33,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:53:33" (1/1) ... [2023-12-24 21:53:33,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:53:33" (1/1) ... [2023-12-24 21:53:33,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:53:33" (1/1) ... [2023-12-24 21:53:33,554 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2023-12-24 21:53:33,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:53:33" (1/1) ... [2023-12-24 21:53:33,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:53:33" (1/1) ... [2023-12-24 21:53:33,574 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:53:33" (1/1) ... [2023-12-24 21:53:33,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:53:33" (1/1) ... [2023-12-24 21:53:33,580 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:53:33" (1/1) ... [2023-12-24 21:53:33,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:53:33" (1/1) ... [2023-12-24 21:53:33,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 21:53:33,584 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 21:53:33,585 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 21:53:33,585 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 21:53:33,585 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:53:33" (1/1) ... [2023-12-24 21:53:33,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:53:33,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 21:53:33,637 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:53:33,658 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:53:33,666 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-24 21:53:33,666 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-24 21:53:33,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 21:53:33,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 21:53:33,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 21:53:33,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 21:53:33,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 21:53:33,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 21:53:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 21:53:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 21:53:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 21:53:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 21:53:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 21:53:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 21:53:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 21:53:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 21:53:33,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 21:53:33,782 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 21:53:33,784 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 21:53:33,831 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-24 21:53:33,990 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 21:53:34,016 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 21:53:34,016 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-24 21:53:34,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:53:34 BoogieIcfgContainer [2023-12-24 21:53:34,017 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 21:53:34,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 21:53:34,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 21:53:34,021 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 21:53:34,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:53:33" (1/3) ... [2023-12-24 21:53:34,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464f5069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:53:34, skipping insertion in model container [2023-12-24 21:53:34,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:53:33" (2/3) ... [2023-12-24 21:53:34,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464f5069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:53:34, skipping insertion in model container [2023-12-24 21:53:34,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:53:34" (3/3) ... [2023-12-24 21:53:34,022 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2023-12-24 21:53:34,036 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 21:53:34,037 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 21:53:34,083 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 21:53:34,088 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;@48f71618, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 21:53:34,088 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 21:53:34,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 23 states have internal predecessors, (33), 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:53:34,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-24 21:53:34,097 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:53:34,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:53:34,098 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:53:34,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:53:34,103 INFO L85 PathProgramCache]: Analyzing trace with hash -332904746, now seen corresponding path program 1 times [2023-12-24 21:53:34,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:53:34,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286378661] [2023-12-24 21:53:34,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:53:34,115 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:53:34,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:53:34,117 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:53:34,152 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:53:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:53:34,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 21:53:34,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:53:34,233 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:53:34,233 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:53:34,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:53:34,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286378661] [2023-12-24 21:53:34,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286378661] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:53:34,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:53:34,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:53:34,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839295649] [2023-12-24 21:53:34,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:53:34,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 21:53:34,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:53:34,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 21:53:34,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:53:34,266 INFO L87 Difference]: Start difference. First operand has 25 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 23 states have internal predecessors, (33), 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:53:34,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:53:34,288 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2023-12-24 21:53:34,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 21:53:34,290 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:53:34,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:53:34,294 INFO L225 Difference]: With dead ends: 40 [2023-12-24 21:53:34,294 INFO L226 Difference]: Without dead ends: 18 [2023-12-24 21:53:34,297 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:53:34,301 INFO L413 NwaCegarLoop]: 28 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, 28 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:53:34,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:53:34,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-24 21:53:34,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-12-24 21:53:34,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:53:34,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-12-24 21:53:34,327 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 8 [2023-12-24 21:53:34,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:53:34,327 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-12-24 21:53:34,327 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:53:34,327 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-12-24 21:53:34,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-24 21:53:34,329 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:53:34,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:53:34,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 21:53:34,532 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:53:34,533 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:53:34,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:53:34,533 INFO L85 PathProgramCache]: Analyzing trace with hash -343986998, now seen corresponding path program 1 times [2023-12-24 21:53:34,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:53:34,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505949516] [2023-12-24 21:53:34,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:53:34,563 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:53:34,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:53:34,565 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:53:34,566 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:53:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:53:34,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:53:34,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:53:34,681 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:53:34,682 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:53:34,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:53:34,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505949516] [2023-12-24 21:53:34,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505949516] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:53:34,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:53:34,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:53:34,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78416407] [2023-12-24 21:53:34,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:53:34,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:53:34,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:53:34,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:53:34,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:53:34,687 INFO L87 Difference]: Start difference. First operand 18 states and 22 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:53:34,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:53:34,719 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2023-12-24 21:53:34,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:53:34,720 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:53:34,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:53:34,720 INFO L225 Difference]: With dead ends: 33 [2023-12-24 21:53:34,720 INFO L226 Difference]: Without dead ends: 21 [2023-12-24 21:53:34,721 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:53:34,721 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 33 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.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:53:34,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 33 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:53:34,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-24 21:53:34,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2023-12-24 21:53:34,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:53:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-12-24 21:53:34,725 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 8 [2023-12-24 21:53:34,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:53:34,725 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-12-24 21:53:34,725 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:53:34,725 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-12-24 21:53:34,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-24 21:53:34,725 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:53:34,726 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:53:34,733 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 (3)] Ended with exit code 0 [2023-12-24 21:53:34,933 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:53:34,934 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:53:34,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:53:34,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2006919056, now seen corresponding path program 1 times [2023-12-24 21:53:34,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:53:34,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572467729] [2023-12-24 21:53:34,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:53:34,935 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:53:34,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:53:34,937 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:53:34,938 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:53:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:53:35,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 21:53:35,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:53:35,044 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:53:35,044 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:53:35,080 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:53:35,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:53:35,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572467729] [2023-12-24 21:53:35,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572467729] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:53:35,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:53:35,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-24 21:53:35,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114013892] [2023-12-24 21:53:35,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:53:35,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 21:53:35,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:53:35,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 21:53:35,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:53:35,082 INFO L87 Difference]: Start difference. First operand 19 states and 23 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:53:35,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:53:35,180 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2023-12-24 21:53:35,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 21:53:35,181 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:53:35,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:53:35,181 INFO L225 Difference]: With dead ends: 40 [2023-12-24 21:53:35,181 INFO L226 Difference]: Without dead ends: 28 [2023-12-24 21:53:35,181 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:53:35,182 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:53:35,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 80 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:53:35,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-24 21:53:35,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-24 21:53:35,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:53:35,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-12-24 21:53:35,186 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 11 [2023-12-24 21:53:35,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:53:35,187 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-12-24 21:53:35,187 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:53:35,187 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-12-24 21:53:35,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-24 21:53:35,187 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:53:35,187 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:53:35,190 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 (4)] Ended with exit code 0 [2023-12-24 21:53:35,388 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:53:35,389 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:53:35,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:53:35,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1890277046, now seen corresponding path program 2 times [2023-12-24 21:53:35,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:53:35,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264045991] [2023-12-24 21:53:35,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:53:35,390 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:53:35,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:53:35,391 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:53:35,399 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:53:35,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:53:35,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:53:35,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 21:53:35,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:53:35,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:53:35,825 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 23 treesize of output 11 [2023-12-24 21:53:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-24 21:53:35,860 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:53:36,061 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-24 21:53:36,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:53:36,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264045991] [2023-12-24 21:53:36,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264045991] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:53:36,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:53:36,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-24 21:53:36,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964952962] [2023-12-24 21:53:36,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:53:36,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 21:53:36,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:53:36,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 21:53:36,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-24 21:53:36,074 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 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:53:36,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:53:36,313 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2023-12-24 21:53:36,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 21:53:36,313 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 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:53:36,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:53:36,314 INFO L225 Difference]: With dead ends: 32 [2023-12-24 21:53:36,314 INFO L226 Difference]: Without dead ends: 30 [2023-12-24 21:53:36,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-12-24 21:53:36,315 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:53:36,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 84 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 21:53:36,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-24 21:53:36,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-24 21:53:36,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 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:53:36,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-12-24 21:53:36,319 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2023-12-24 21:53:36,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:53:36,319 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-12-24 21:53:36,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 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:53:36,319 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-12-24 21:53:36,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-24 21:53:36,320 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:53:36,320 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:53:36,339 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:53:36,520 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:53:36,521 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:53:36,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:53:36,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1926323958, now seen corresponding path program 1 times [2023-12-24 21:53:36,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:53:36,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015296227] [2023-12-24 21:53:36,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:53:36,522 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:53:36,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:53:36,523 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:53:36,527 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:53:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:53:36,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-24 21:53:36,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:53:36,781 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:53:36,825 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-24 21:53:36,825 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:53:36,863 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-24 21:53:36,863 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:53:36,899 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 21:53:36,899 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:53:36,944 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:53:37,018 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-24 21:53:37,044 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-24 21:53:37,044 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 1 case distinctions, treesize of input 20 treesize of output 23 [2023-12-24 21:53:37,051 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:37,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2023-12-24 21:53:37,141 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-12-24 21:53:37,142 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 34 [2023-12-24 21:53:37,153 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 20 treesize of output 15 [2023-12-24 21:53:37,173 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-24 21:53:37,174 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 1 case distinctions, treesize of input 19 treesize of output 18 [2023-12-24 21:53:37,447 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-24 21:53:37,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 100 treesize of output 78 [2023-12-24 21:53:37,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:37,483 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 92 treesize of output 84 [2023-12-24 21:53:37,550 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2023-12-24 21:53:37,550 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 79 [2023-12-24 21:53:37,574 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-24 21:53:37,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 75 treesize of output 69 [2023-12-24 21:53:37,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:37,611 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 60 treesize of output 72 [2023-12-24 21:53:37,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 21:53:37,923 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-24 21:53:37,923 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:53:38,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:38,188 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 376 treesize of output 378 [2023-12-24 21:53:38,950 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse1 (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse22 .cse5)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_4 .cse5)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse22 .cse3)))))) (.cse2 (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_4 .cse3)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse21 .cse5)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_4 .cse5)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse21 .cse3)))))) (.cse7 (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse20 .cse5)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse20 .cse3)))))) (.cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse9 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse11 (not .cse0)) (.cse10 (and .cse1 .cse2 .cse7))) (and (or .cse0 (and .cse1 .cse2 (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse3)) (= (select .cse4 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse4 .cse5)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse5))))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_6) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse6 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse6 .cse5)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse5))))) .cse7 (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse8 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse8 .cse5)))))) .cse9) (or .cse0 .cse9 .cse10) (or (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse3)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_9) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse5)))) .cse11) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_225 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_219) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5))))) (or (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_3 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_2 .cse3)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_3) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_2) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5)))) .cse11) (or .cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_9) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse3)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse12 .cse3)) (= (select .cse12 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse5)))))) (or (and (or .cse11 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse3)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_9) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse5))))) (or .cse0 (forall ((v_prenex_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_7) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_6) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5)))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_9) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse13 .cse3)) (= (select .cse13 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse3)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse5)))) (or .cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_9) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse14 .cse3)) (= (select .cse14 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse5)))))) (or .cse11 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_3 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_2 .cse3)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_3) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_2) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_225 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_219) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5))))) (or (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_9) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse15 .cse3)) (= (select .cse15 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse0) (or .cse0 .cse10) (or .cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_9) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse3)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse16 .cse3)) (= (select .cse16 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse5))))))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (or (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_9) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse17 .cse3)) (= (select .cse17 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) .cse0) (or .cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_9) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse18 .cse3)) (= (select .cse18 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse5)))))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse3)) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_9) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse19 .cse3)) (= (select .cse19 .cse5) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse5)))) (or .cse0 (forall ((v_prenex_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_7) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_6) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5))))))))) is different from false [2023-12-24 21:53:39,902 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32))) (.cse6 (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse21 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_4 (_ bv4 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_4 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse21 (_ bv4 32))))))) (.cse7 (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse20 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_4 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse20 (_ bv4 32))))))) (.cse11 (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse19 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse19 (_ bv4 32)))))))) (let ((.cse5 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse13 (and .cse6 .cse7 .cse11)) (.cse4 (not .cse0))) (and (or .cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_9) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_prenex_8 (_ bv4 32)) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse1 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse1 (_ bv4 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse2)))))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select v_prenex_8 (_ bv4 32)) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_9) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select .cse3 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse3 (_ bv4 32)))))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse2)))) (or .cse0 (forall ((v_prenex_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_7) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_6) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))) (or .cse4 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_3 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_2 (_ bv4 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_3) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_2) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))) (or .cse0 .cse5 (and .cse6 .cse7 (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_6) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse8 (_ bv4 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse8 .cse2))))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_prenex_8 (_ bv4 32)) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse9 (_ bv4 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse9 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse2))))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse10 (_ bv4 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse10 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse2))))) .cse11)) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_225 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_219) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))) (or .cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_9) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse12 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse12 (_ bv4 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse2)))))) (or .cse0 .cse5 .cse13) (or (= (_ bv0 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (and (or .cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_9) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse14 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse14 (_ bv4 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse2)))))) (or .cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_9) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse15 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse15 (_ bv4 32))))))) (or (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_3 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_2 (_ bv4 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_3) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_2) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) .cse4) (or .cse4 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select v_prenex_8 (_ bv4 32)) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_9) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse2))))) (or .cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_9) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_prenex_8 (_ bv4 32)) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse16 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse16 (_ bv4 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse2)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_225 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_219) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))) (or .cse0 (forall ((v_prenex_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_7) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_6) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) (or .cse0 .cse13) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select v_prenex_8 (_ bv4 32)) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_9) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select .cse17 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse17 (_ bv4 32)))))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse2)))))) (or (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_9) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse18 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse18 (_ bv4 32)))))) .cse0) (or .cse4 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (_ BitVec 32)) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select v_prenex_8 (_ bv4 32)) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_9) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_8 .cse2))))))))) is different from false [2023-12-24 21:53:40,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:40,033 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 25 treesize of output 26 [2023-12-24 21:53:40,037 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:53:40,039 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 36 treesize of output 24 [2023-12-24 21:53:40,042 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 7 treesize of output 3 [2023-12-24 21:53:40,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:40,054 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 15 [2023-12-24 21:53:40,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:40,066 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 43 treesize of output 33 [2023-12-24 21:53:40,067 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:53:40,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:40,076 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 27 treesize of output 19 [2023-12-24 21:53:40,090 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-24 21:53:40,090 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 43 treesize of output 1 [2023-12-24 21:53:40,097 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-24 21:53:40,098 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 43 treesize of output 1 [2023-12-24 21:53:40,111 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-24 21:53:40,111 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 25 treesize of output 1 [2023-12-24 21:53:40,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:40,118 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 25 treesize of output 26 [2023-12-24 21:53:40,122 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:53:40,123 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 36 treesize of output 24 [2023-12-24 21:53:40,129 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 7 treesize of output 3 [2023-12-24 21:53:40,137 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-24 21:53:40,137 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 1 case distinctions, treesize of input 49 treesize of output 1 [2023-12-24 21:53:40,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:40,149 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 25 treesize of output 26 [2023-12-24 21:53:40,151 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:53:40,153 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 36 treesize of output 24 [2023-12-24 21:53:40,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:53:40,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:40,166 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 25 treesize of output 26 [2023-12-24 21:53:40,169 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:53:40,172 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 36 treesize of output 24 [2023-12-24 21:53:40,177 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:53:40,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2023-12-24 21:53:40,192 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:53:40,192 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 18 treesize of output 1 [2023-12-24 21:53:40,198 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:53:40,198 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 18 treesize of output 1 [2023-12-24 21:53:40,204 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:53:40,204 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 18 treesize of output 1 [2023-12-24 21:53:40,211 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:53:40,212 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 18 treesize of output 1 [2023-12-24 21:53:40,217 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:53:40,218 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 18 treesize of output 1 [2023-12-24 21:53:40,228 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:53:40,229 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 1 case distinctions, treesize of input 21 treesize of output 1 [2023-12-24 21:53:40,237 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:53:40,238 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 1 case distinctions, treesize of input 21 treesize of output 1 [2023-12-24 21:53:40,247 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:53:40,247 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 1 case distinctions, treesize of input 21 treesize of output 1 [2023-12-24 21:53:40,254 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:53:40,254 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 1 case distinctions, treesize of input 21 treesize of output 1 [2023-12-24 21:53:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 10 not checked. [2023-12-24 21:53:41,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:53:41,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2015296227] [2023-12-24 21:53:41,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2015296227] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:53:41,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:53:41,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-12-24 21:53:41,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706086234] [2023-12-24 21:53:41,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:53:41,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-24 21:53:41,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:53:41,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-24 21:53:41,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=232, Unknown=2, NotChecked=62, Total=342 [2023-12-24 21:53:41,632 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 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:53:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:53:43,457 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2023-12-24 21:53:43,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 21:53:43,457 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 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:53:43,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:53:43,459 INFO L225 Difference]: With dead ends: 50 [2023-12-24 21:53:43,459 INFO L226 Difference]: Without dead ends: 48 [2023-12-24 21:53:43,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=131, Invalid=575, Unknown=4, NotChecked=102, Total=812 [2023-12-24 21:53:43,459 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 33 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 8 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:53:43,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 77 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 198 Invalid, 8 Unknown, 77 Unchecked, 1.0s Time] [2023-12-24 21:53:43,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-24 21:53:43,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. [2023-12-24 21:53:43,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 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:53:43,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2023-12-24 21:53:43,464 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 23 [2023-12-24 21:53:43,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:53:43,464 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2023-12-24 21:53:43,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 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:53:43,465 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2023-12-24 21:53:43,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-24 21:53:43,465 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:53:43,465 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:53:43,472 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:53:43,665 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:53:43,666 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:53:43,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:53:43,666 INFO L85 PathProgramCache]: Analyzing trace with hash 412114079, now seen corresponding path program 1 times [2023-12-24 21:53:43,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:53:43,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954157724] [2023-12-24 21:53:43,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:53:43,667 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:53:43,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:53:43,668 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:53:43,674 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:53:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:53:43,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-24 21:53:43,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:53:43,842 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:53:43,866 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-12-24 21:53:43,866 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 21 treesize of output 20 [2023-12-24 21:53:43,880 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-24 21:53:43,880 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:53:43,905 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:53:43,905 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:53:43,957 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-12-24 21:53:43,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-12-24 21:53:43,994 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2023-12-24 21:53:44,042 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 25 treesize of output 18 [2023-12-24 21:53:44,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-24 21:53:44,069 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:53:44,088 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:53:44,089 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:53:44,107 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2023-12-24 21:53:44,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2023-12-24 21:53:44,129 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:54:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 6 refuted. 1 times theorem prover too weak. 0 trivial. 4 not checked. [2023-12-24 21:54:18,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:54:18,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954157724] [2023-12-24 21:54:18,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954157724] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:54:18,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:54:18,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2023-12-24 21:54:18,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597504872] [2023-12-24 21:54:18,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:54:18,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-24 21:54:18,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:54:18,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-24 21:54:18,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=180, Unknown=8, NotChecked=28, Total=272 [2023-12-24 21:54:18,686 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 16 states have internal predecessors, (40), 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:19,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:54:19,476 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2023-12-24 21:54:19,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 21:54:19,478 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 16 states have internal predecessors, (40), 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:19,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:54:19,478 INFO L225 Difference]: With dead ends: 41 [2023-12-24 21:54:19,479 INFO L226 Difference]: Without dead ends: 33 [2023-12-24 21:54:19,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=114, Invalid=302, Unknown=8, NotChecked=38, Total=462 [2023-12-24 21:54:19,479 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 21:54:19,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 93 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 17 Unchecked, 0.6s Time] [2023-12-24 21:54:19,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-24 21:54:19,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-24 21:54:19,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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:19,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2023-12-24 21:54:19,484 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 24 [2023-12-24 21:54:19,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:54:19,484 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2023-12-24 21:54:19,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 16 states have internal predecessors, (40), 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:19,484 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2023-12-24 21:54:19,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-24 21:54:19,484 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:54:19,485 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:54:19,493 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:19,690 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:19,691 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:54:19,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:54:19,691 INFO L85 PathProgramCache]: Analyzing trace with hash -2058055350, now seen corresponding path program 2 times [2023-12-24 21:54:19,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:54:19,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704726924] [2023-12-24 21:54:19,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:54:19,692 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:19,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:54:19,692 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:19,694 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:20,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:54:20,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:54:20,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 69 conjunts are in the unsatisfiable core [2023-12-24 21:54:20,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:54:20,045 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:20,085 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:54:20,086 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:20,164 INFO L349 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-12-24 21:54:20,164 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:20,250 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:54:20,354 INFO L349 Elim1Store]: treesize reduction 66, result has 34.0 percent of original size [2023-12-24 21:54:20,355 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:20,573 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2023-12-24 21:54:20,597 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 20 treesize of output 15 [2023-12-24 21:54:20,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-24 21:54:20,794 INFO L349 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2023-12-24 21:54:20,795 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:20,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 30 treesize of output 22 [2023-12-24 21:54:20,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 78 treesize of output 35 [2023-12-24 21:54:20,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 24 treesize of output 19 [2023-12-24 21:54:21,129 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-24 21:54:21,130 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 86 treesize of output 55 [2023-12-24 21:54:21,139 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 24 treesize of output 19 [2023-12-24 21:54:21,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:54:21,152 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 27 treesize of output 25 [2023-12-24 21:54:21,316 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-24 21:54:21,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 198 treesize of output 109 [2023-12-24 21:54:21,330 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 36 treesize of output 23 [2023-12-24 21:54:21,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:54:21,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 33 [2023-12-24 21:54:21,517 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-24 21:54:21,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 238 treesize of output 109 [2023-12-24 21:54:21,550 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-24 21:54:21,550 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 199 treesize of output 85 [2023-12-24 21:54:21,570 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:21,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2023-12-24 21:54:21,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 21:54:21,680 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:21,681 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:54:21,802 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (_ BitVec 32)) (v_ArrVal_414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (or (not (= v_ArrVal_411 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0 (select v_ArrVal_411 .cse0)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse3 (select v_ArrVal_411 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_410) .cse1 v_ArrVal_414) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse2 .cse0 v_ArrVal_412)) .cse1) .cse3)) (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_411) .cse1) .cse3) (_ bv4 32))))))))) is different from false [2023-12-24 21:54:21,875 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (_ BitVec 32)) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_408)) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse4 (select v_ArrVal_411 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_407) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_410) .cse0 v_ArrVal_414) (select (select (store .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_ArrVal_412)) .cse0) .cse4)) (bvadd (_ bv4 32) (select (select (store .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_411) .cse0) .cse4))))))) (not (= v_ArrVal_411 (store (select .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_411 .cse3))))))) is different from false [2023-12-24 21:54:22,021 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (_ BitVec 32)) (v_ArrVal_412 (_ BitVec 32)) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (not (= v_ArrVal_411 (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse0 v_ArrVal_405)) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_408) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_411 .cse0)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_403))) (let ((.cse2 (store (select .cse5 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse3 (select (store .cse5 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse2) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse4 (select v_ArrVal_411 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_407) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_410) .cse1 v_ArrVal_414) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse2) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse3 .cse0 v_ArrVal_412)) .cse1) .cse4)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_408) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_411) .cse1) .cse4)))))))) (not (= v_ArrVal_403 (store (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_403 .cse0))))))) is different from false [2023-12-24 21:54:22,172 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_39| (_ BitVec 32)) (v_ArrVal_412 (_ BitVec 32)) (v_ArrVal_407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_414 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_411 (store (select (store (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_39| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_39|) (_ bv0 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv4 32) v_ArrVal_405)) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_408) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_39|) (_ bv4 32) (select v_ArrVal_411 (_ bv4 32))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_39|))) (not (= v_ArrVal_403 (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_39|) (_ bv0 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (_ bv4 32) (select v_ArrVal_403 (_ bv4 32))))) (= (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_39| v_ArrVal_403))) (let ((.cse1 (store (select .cse4 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_39|))) (let ((.cse2 (select (store .cse4 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse1) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_39|))) (let ((.cse0 (select .cse2 (_ bv0 32))) (.cse3 (select v_ArrVal_411 (_ bv0 32)))) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_407) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_39| v_ArrVal_410) .cse0 v_ArrVal_414) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse1) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_39| (store .cse2 (_ bv4 32) v_ArrVal_412)) .cse0) .cse3)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_408) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_39| v_ArrVal_411) .cse0) .cse3))))))) |c_ULTIMATE.start_main_~data_init~0#1|))) is different from false [2023-12-24 21:54:32,453 WARN L293 SmtUtils]: Spent 10.21s on a formula simplification. DAG size of input: 105 DAG size of output: 67 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-24 21:54:32,453 INFO L349 Elim1Store]: treesize reduction 116, result has 51.9 percent of original size [2023-12-24 21:54:32,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 39992 treesize of output 39629 [2023-12-24 21:54:34,149 INFO L349 Elim1Store]: treesize reduction 84, result has 52.5 percent of original size [2023-12-24 21:54:34,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 2477 treesize of output 2130 [2023-12-24 21:54:34,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:54:34,540 INFO L349 Elim1Store]: treesize reduction 96, result has 11.9 percent of original size [2023-12-24 21:54:34,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 6917 treesize of output 6736 [2023-12-24 21:54:34,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:54:34,850 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 3424 treesize of output 3266 [2023-12-24 21:54:35,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:54:35,112 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 2114 treesize of output 1994 [2023-12-24 21:54:36,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:54:36,486 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 1 case distinctions, treesize of input 12 treesize of output 6 [2023-12-24 21:54:36,676 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:54:36,691 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 12 treesize of output 1 [2023-12-24 21:54:36,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:54:36,864 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 1 case distinctions, treesize of input 12 treesize of output 6 [2023-12-24 21:54:37,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:54:37,029 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 1 case distinctions, treesize of input 12 treesize of output 6 [2023-12-24 21:54:37,194 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:54:37,195 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 19 treesize of output 13 Received shutdown request... [2023-12-24 22:08:08,552 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:08:08,553 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:08:09,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 22:08:09,754 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-24 22:08:09,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-24 22:08:09,846 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 22:08:09,846 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-24 22:08:09,863 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2023-12-24 22:08:09,864 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 22:08:09,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 10:08:09 BoogieIcfgContainer [2023-12-24 22:08:09,866 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 22:08:09,867 INFO L158 Benchmark]: Toolchain (without parser) took 876675.93ms. Allocated memory was 180.4MB in the beginning and 625.0MB in the end (delta: 444.6MB). Free memory was 125.3MB in the beginning and 217.7MB in the end (delta: -92.5MB). Peak memory consumption was 369.9MB. Max. memory is 8.0GB. [2023-12-24 22:08:09,867 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 180.4MB. Free memory is still 134.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 22:08:09,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.82ms. Allocated memory is still 180.4MB. Free memory was 124.8MB in the beginning and 105.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-24 22:08:09,868 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.57ms. Allocated memory is still 180.4MB. Free memory was 105.9MB in the beginning and 103.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 22:08:09,868 INFO L158 Benchmark]: Boogie Preprocessor took 61.61ms. Allocated memory is still 180.4MB. Free memory was 103.8MB in the beginning and 101.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 22:08:09,868 INFO L158 Benchmark]: RCFGBuilder took 432.50ms. Allocated memory is still 180.4MB. Free memory was 101.3MB in the beginning and 83.9MB in the end (delta: 17.4MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-24 22:08:09,868 INFO L158 Benchmark]: TraceAbstraction took 875848.00ms. Allocated memory was 180.4MB in the beginning and 625.0MB in the end (delta: 444.6MB). Free memory was 83.4MB in the beginning and 217.7MB in the end (delta: -134.3MB). Peak memory consumption was 328.0MB. Max. memory is 8.0GB. [2023-12-24 22:08:09,870 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 180.4MB. Free memory is still 134.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 292.82ms. Allocated memory is still 180.4MB. Free memory was 124.8MB in the beginning and 105.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.57ms. Allocated memory is still 180.4MB. Free memory was 105.9MB in the beginning and 103.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 61.61ms. Allocated memory is still 180.4MB. Free memory was 103.8MB in the beginning and 101.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 432.50ms. Allocated memory is still 180.4MB. Free memory was 101.3MB in the beginning and 83.9MB in the end (delta: 17.4MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 875848.00ms. Allocated memory was 180.4MB in the beginning and 625.0MB in the end (delta: 444.6MB). Free memory was 83.4MB in the beginning and 217.7MB in the end (delta: -134.3MB). Peak memory consumption was 328.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: 623]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 623). Cancelled while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 875.8s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 395 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 94 IncrementalHoareTripleChecker+Unchecked, 297 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 467 IncrementalHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 98 mSDtfsCounter, 467 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 110 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 37.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=5, InterpolantAutomatonStates: 45, 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, 17 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 40.4s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 162 ConstructedInterpolants, 31 QuantifiedInterpolants, 5055 SizeOfPredicates, 38 NumberOfNonLiveVariables, 755 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 63/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