/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/dll2n_insert_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 21:29:25,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 21:29:25,965 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:29:25,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 21:29:25,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 21:29:25,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 21:29:25,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 21:29:25,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 21:29:25,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 21:29:25,998 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 21:29:25,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 21:29:25,999 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 21:29:25,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 21:29:26,000 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 21:29:26,000 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 21:29:26,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 21:29:26,001 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 21:29:26,001 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 21:29:26,001 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 21:29:26,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 21:29:26,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 21:29:26,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 21:29:26,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 21:29:26,003 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 21:29:26,003 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 21:29:26,003 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 21:29:26,003 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 21:29:26,003 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 21:29:26,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 21:29:26,004 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 21:29:26,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 21:29:26,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 21:29:26,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 21:29:26,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 21:29:26,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:29:26,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 21:29:26,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 21:29:26,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 21:29:26,005 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 21:29:26,005 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 21:29:26,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 21:29:26,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 21:29:26,006 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 21:29:26,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 21:29:26,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 21:29:26,006 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 21:29:26,006 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:29:26,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 21:29:26,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 21:29:26,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 21:29:26,185 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 21:29:26,185 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 21:29:26,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_insert_equal.i [2023-12-24 21:29:27,209 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 21:29:27,447 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 21:29:27,447 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_insert_equal.i [2023-12-24 21:29:27,469 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99170491e/a68809c3e1694d08bfe48c210b14f3a7/FLAG000194e2d [2023-12-24 21:29:27,483 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99170491e/a68809c3e1694d08bfe48c210b14f3a7 [2023-12-24 21:29:27,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 21:29:27,485 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 21:29:27,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 21:29:27,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 21:29:27,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 21:29:27,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:29:27" (1/1) ... [2023-12-24 21:29:27,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2244bf57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:27, skipping insertion in model container [2023-12-24 21:29:27,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:29:27" (1/1) ... [2023-12-24 21:29:27,535 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:29:27,774 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_insert_equal.i[24706,24719] [2023-12-24 21:29:27,776 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:29:27,789 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 21:29:27,828 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_insert_equal.i[24706,24719] [2023-12-24 21:29:27,829 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:29:27,847 INFO L206 MainTranslator]: Completed translation [2023-12-24 21:29:27,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:27 WrapperNode [2023-12-24 21:29:27,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 21:29:27,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 21:29:27,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 21:29:27,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 21:29:27,852 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:29:27" (1/1) ... [2023-12-24 21:29:27,869 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:29:27" (1/1) ... [2023-12-24 21:29:27,886 INFO L138 Inliner]: procedures = 130, calls = 44, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 139 [2023-12-24 21:29:27,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 21:29:27,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 21:29:27,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 21:29:27,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 21:29:27,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:27" (1/1) ... [2023-12-24 21:29:27,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:27" (1/1) ... [2023-12-24 21:29:27,899 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:27" (1/1) ... [2023-12-24 21:29:27,917 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 17, 8]. 63 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2023-12-24 21:29:27,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:27" (1/1) ... [2023-12-24 21:29:27,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:27" (1/1) ... [2023-12-24 21:29:27,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:27" (1/1) ... [2023-12-24 21:29:27,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:27" (1/1) ... [2023-12-24 21:29:27,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:27" (1/1) ... [2023-12-24 21:29:27,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:27" (1/1) ... [2023-12-24 21:29:27,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 21:29:27,936 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 21:29:27,936 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 21:29:27,936 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 21:29:27,936 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:27" (1/1) ... [2023-12-24 21:29:27,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:29:27,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 21:29:27,957 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:29:27,973 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:29:27,992 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-24 21:29:27,992 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-24 21:29:27,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 21:29:27,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 21:29:27,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 21:29:27,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 21:29:27,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 21:29:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-24 21:29:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 21:29:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 21:29:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-24 21:29:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 21:29:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 21:29:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-24 21:29:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 21:29:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 21:29:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 21:29:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 21:29:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-24 21:29:27,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-24 21:29:27,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-24 21:29:27,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 21:29:27,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 21:29:27,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 21:29:27,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 21:29:27,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 21:29:28,142 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 21:29:28,143 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 21:29:28,180 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-24 21:29:28,474 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 21:29:28,508 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 21:29:28,508 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-24 21:29:28,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:29:28 BoogieIcfgContainer [2023-12-24 21:29:28,509 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 21:29:28,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 21:29:28,510 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 21:29:28,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 21:29:28,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:29:27" (1/3) ... [2023-12-24 21:29:28,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c28ff16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:29:28, skipping insertion in model container [2023-12-24 21:29:28,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:27" (2/3) ... [2023-12-24 21:29:28,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c28ff16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:29:28, skipping insertion in model container [2023-12-24 21:29:28,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:29:28" (3/3) ... [2023-12-24 21:29:28,514 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_equal.i [2023-12-24 21:29:28,542 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 21:29:28,543 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 21:29:28,576 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 21:29:28,580 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;@7abf22ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 21:29:28,580 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 21:29:28,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 26 states have internal predecessors, (41), 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:29:28,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-24 21:29:28,587 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:28,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:28,587 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:28,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:28,591 INFO L85 PathProgramCache]: Analyzing trace with hash 342889473, now seen corresponding path program 1 times [2023-12-24 21:29:28,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:28,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546025] [2023-12-24 21:29:28,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:28,599 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:29:28,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:28,601 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:29:28,606 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:29:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:28,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 21:29:28,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:28,750 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:29:28,751 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:29:28,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:28,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546025] [2023-12-24 21:29:28,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546025] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:29:28,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:29:28,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:29:28,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135334831] [2023-12-24 21:29:28,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:29:28,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 21:29:28,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:28,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 21:29:28,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:29:28,787 INFO L87 Difference]: Start difference. First operand has 28 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 26 states have internal predecessors, (41), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:29:28,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:28,841 INFO L93 Difference]: Finished difference Result 49 states and 75 transitions. [2023-12-24 21:29:28,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 21:29:28,842 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2023-12-24 21:29:28,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:28,846 INFO L225 Difference]: With dead ends: 49 [2023-12-24 21:29:28,846 INFO L226 Difference]: Without dead ends: 20 [2023-12-24 21:29:28,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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:29:28,851 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:28,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:29:28,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-24 21:29:28,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-24 21:29:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 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:29:28,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2023-12-24 21:29:28,873 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 12 [2023-12-24 21:29:28,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:28,874 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2023-12-24 21:29:28,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:29:28,874 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2023-12-24 21:29:28,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-24 21:29:28,875 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:28,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:28,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 21:29:29,082 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:29:29,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:29,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:29,083 INFO L85 PathProgramCache]: Analyzing trace with hash 125226926, now seen corresponding path program 1 times [2023-12-24 21:29:29,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:29,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155187971] [2023-12-24 21:29:29,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:29,085 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:29:29,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:29,086 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:29:29,128 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:29:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:29,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:29:29,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:29,227 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:29:29,227 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:29:29,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:29,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155187971] [2023-12-24 21:29:29,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155187971] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:29:29,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:29:29,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:29:29,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660397719] [2023-12-24 21:29:29,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:29:29,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:29:29,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:29,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:29:29,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:29:29,229 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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:29:29,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:29,284 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2023-12-24 21:29:29,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:29:29,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2023-12-24 21:29:29,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:29,286 INFO L225 Difference]: With dead ends: 39 [2023-12-24 21:29:29,287 INFO L226 Difference]: Without dead ends: 25 [2023-12-24 21:29:29,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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:29:29,288 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:29,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 43 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:29:29,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-24 21:29:29,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2023-12-24 21:29:29,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:29:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2023-12-24 21:29:29,291 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 12 [2023-12-24 21:29:29,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:29,291 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2023-12-24 21:29:29,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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:29:29,292 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2023-12-24 21:29:29,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-24 21:29:29,292 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:29,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:29,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 21:29:29,495 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:29:29,496 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:29,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:29,496 INFO L85 PathProgramCache]: Analyzing trace with hash -590731374, now seen corresponding path program 1 times [2023-12-24 21:29:29,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:29,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812651105] [2023-12-24 21:29:29,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:29,497 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:29:29,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:29,498 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:29:29,505 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:29:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:29,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 21:29:29,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:29:29,679 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:29:29,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:29,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812651105] [2023-12-24 21:29:29,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812651105] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:29:29,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:29:29,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:29:29,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752561658] [2023-12-24 21:29:29,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:29:29,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:29:29,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:29,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:29:29,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:29:29,685 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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:29:29,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:29,832 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2023-12-24 21:29:29,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:29:29,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 17 [2023-12-24 21:29:29,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:29,836 INFO L225 Difference]: With dead ends: 44 [2023-12-24 21:29:29,837 INFO L226 Difference]: Without dead ends: 25 [2023-12-24 21:29:29,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:29:29,838 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:29,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:29:29,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-24 21:29:29,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2023-12-24 21:29:29,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:29:29,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-24 21:29:29,842 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 17 [2023-12-24 21:29:29,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:29,842 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-24 21:29:29,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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:29:29,842 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-24 21:29:29,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-24 21:29:29,843 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:29,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:29,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 21:29:30,043 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:29:30,044 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:30,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:30,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1177537388, now seen corresponding path program 1 times [2023-12-24 21:29:30,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:30,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828796922] [2023-12-24 21:29:30,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:30,049 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:29:30,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:30,050 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:29:30,052 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:29:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:30,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 21:29:30,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:30,190 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:29:30,190 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:30,221 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:29:30,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:30,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828796922] [2023-12-24 21:29:30,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [828796922] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:29:30,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:29:30,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-24 21:29:30,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999998844] [2023-12-24 21:29:30,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:29:30,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 21:29:30,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:30,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 21:29:30,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:29:30,224 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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:29:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:30,330 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2023-12-24 21:29:30,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 21:29:30,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 17 [2023-12-24 21:29:30,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:30,332 INFO L225 Difference]: With dead ends: 44 [2023-12-24 21:29:30,332 INFO L226 Difference]: Without dead ends: 30 [2023-12-24 21:29:30,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:29:30,333 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:30,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 84 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:29:30,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-24 21:29:30,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2023-12-24 21:29:30,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:29:30,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-12-24 21:29:30,338 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 17 [2023-12-24 21:29:30,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:30,338 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-12-24 21:29:30,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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:29:30,338 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-12-24 21:29:30,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-24 21:29:30,338 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:30,339 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:30,344 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:29:30,544 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:29:30,545 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:30,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:30,545 INFO L85 PathProgramCache]: Analyzing trace with hash -416685460, now seen corresponding path program 1 times [2023-12-24 21:29:30,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:30,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076389752] [2023-12-24 21:29:30,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:30,547 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:29:30,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:30,549 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:29:30,549 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:29:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:30,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:29:30,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-24 21:29:30,756 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:29:30,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:30,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076389752] [2023-12-24 21:29:30,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076389752] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:29:30,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:29:30,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 21:29:30,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934192149] [2023-12-24 21:29:30,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:29:30,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:29:30,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:30,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:29:30,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:29:30,766 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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:29:30,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:30,819 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2023-12-24 21:29:30,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 21:29:30,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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 22 [2023-12-24 21:29:30,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:30,820 INFO L225 Difference]: With dead ends: 37 [2023-12-24 21:29:30,820 INFO L226 Difference]: Without dead ends: 27 [2023-12-24 21:29:30,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 21:29:30,821 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 20 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:30,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 41 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:29:30,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-24 21:29:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-24 21:29:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 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:29:30,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2023-12-24 21:29:30,824 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 22 [2023-12-24 21:29:30,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:30,825 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2023-12-24 21:29:30,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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:29:30,825 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2023-12-24 21:29:30,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-24 21:29:30,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:30,825 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:30,833 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:29:31,031 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:29:31,032 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:31,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:31,032 INFO L85 PathProgramCache]: Analyzing trace with hash 549172958, now seen corresponding path program 1 times [2023-12-24 21:29:31,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:31,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118597795] [2023-12-24 21:29:31,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:31,033 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:29:31,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:31,057 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:29:31,087 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:29:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:31,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 21:29:31,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:31,285 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:29:31,292 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-24 21:29:31,293 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:29:31,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:31,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118597795] [2023-12-24 21:29:31,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118597795] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:29:31,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:29:31,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 21:29:31,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441628073] [2023-12-24 21:29:31,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:29:31,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 21:29:31,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:31,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 21:29:31,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:29:31,294 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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:29:31,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:31,731 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2023-12-24 21:29:31,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 21:29:31,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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) Word has length 23 [2023-12-24 21:29:31,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:31,733 INFO L225 Difference]: With dead ends: 57 [2023-12-24 21:29:31,733 INFO L226 Difference]: Without dead ends: 37 [2023-12-24 21:29:31,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-24 21:29:31,734 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:31,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 75 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 21:29:31,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-24 21:29:31,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2023-12-24 21:29:31,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:29:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-12-24 21:29:31,738 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 23 [2023-12-24 21:29:31,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:31,738 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-12-24 21:29:31,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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:29:31,739 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-12-24 21:29:31,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-24 21:29:31,739 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:31,739 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:31,744 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:29:31,944 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:29:31,944 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:31,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:31,944 INFO L85 PathProgramCache]: Analyzing trace with hash 549174632, now seen corresponding path program 1 times [2023-12-24 21:29:31,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:31,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384302260] [2023-12-24 21:29:31,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:31,945 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:29:31,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:31,946 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:29:31,948 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:29:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:32,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 53 conjunts are in the unsatisfiable core [2023-12-24 21:29:32,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:32,189 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:29:32,269 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:29:32,270 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:29:32,325 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 25 treesize of output 7 [2023-12-24 21:29:32,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-12-24 21:29:32,431 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:29:32,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2023-12-24 21:29:32,445 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 11 [2023-12-24 21:29:32,607 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:29:32,607 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 32 treesize of output 34 [2023-12-24 21:29:32,754 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 48 treesize of output 31 [2023-12-24 21:29:32,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-24 21:29:32,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 51 treesize of output 19 [2023-12-24 21:29:32,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-12-24 21:29:32,968 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:29:33,007 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:29:33,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-24 21:29:33,091 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:29:33,092 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:33,231 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_459 (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse0 (select v_ArrVal_459 .cse0))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_459) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_460) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-12-24 21:29:33,260 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_insert_~last~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_459) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_457) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0) v_ArrVal_460) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_459 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0 (select v_ArrVal_459 .cse0))))))) is different from false [2023-12-24 21:29:33,425 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 84 treesize of output 64 [2023-12-24 21:29:33,430 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 68 treesize of output 48 [2023-12-24 21:29:33,463 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_node_create_~temp~0#1.base_15| (_ BitVec 32)) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) (or (not (= (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_456) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0 (select v_ArrVal_459 .cse0)) v_ArrVal_459)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_459) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_457) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_455) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0) v_ArrVal_460) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))))) is different from false [2023-12-24 21:29:33,516 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_node_create_~temp~0#1.base_15| (_ BitVec 32)) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (or (not (= (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_456) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_459 .cse0)) v_ArrVal_459)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_459) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_457) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_455) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) v_ArrVal_460) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) (_ bv0 1)))))) is different from false [2023-12-24 21:29:33,556 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_451 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_node_create_~temp~0#1.base_15| (_ BitVec 32)) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_450)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (or (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_459) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_457) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_451) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_455) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_460) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) (_ bv0 1))) (not (= v_ArrVal_459 (store (select (store .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_456) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_459 .cse1))))))) is different from false [2023-12-24 21:29:33,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:29:33,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 311 treesize of output 321 [2023-12-24 21:29:33,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:29:33,626 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 2 case distinctions, treesize of input 104 treesize of output 94 [2023-12-24 21:29:33,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 162 [2023-12-24 21:29:33,656 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 68 treesize of output 66 [2023-12-24 21:29:33,676 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 184 treesize of output 172 [2023-12-24 21:29:33,690 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 79 treesize of output 77 [2023-12-24 21:29:33,717 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 143 treesize of output 127 [2023-12-24 21:29:33,723 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 127 treesize of output 119 [2023-12-24 21:29:33,730 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 53 treesize of output 49 [2023-12-24 21:29:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-12-24 21:29:40,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:40,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384302260] [2023-12-24 21:29:40,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384302260] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:29:40,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:29:40,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2023-12-24 21:29:40,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352077346] [2023-12-24 21:29:40,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:29:40,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-24 21:29:40,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:40,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-24 21:29:40,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=513, Unknown=19, NotChecked=250, Total=870 [2023-12-24 21:29:40,074 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 30 states, 30 states have (on average 1.5) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:29:44,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:44,228 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2023-12-24 21:29:44,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 21:29:44,229 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.5) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-24 21:29:44,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:44,229 INFO L225 Difference]: With dead ends: 47 [2023-12-24 21:29:44,230 INFO L226 Difference]: Without dead ends: 45 [2023-12-24 21:29:44,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=150, Invalid=780, Unknown=20, NotChecked=310, Total=1260 [2023-12-24 21:29:44,230 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:44,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 206 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 442 Invalid, 0 Unknown, 232 Unchecked, 3.7s Time] [2023-12-24 21:29:44,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-24 21:29:44,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2023-12-24 21:29:44,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 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:29:44,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2023-12-24 21:29:44,235 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 23 [2023-12-24 21:29:44,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:44,235 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2023-12-24 21:29:44,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.5) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:29:44,235 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2023-12-24 21:29:44,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-24 21:29:44,236 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:44,236 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:44,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-24 21:29:44,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:29:44,436 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:44,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:44,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1418447905, now seen corresponding path program 1 times [2023-12-24 21:29:44,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:44,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067456207] [2023-12-24 21:29:44,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:44,437 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:29:44,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:44,438 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:29:44,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-24 21:29:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:44,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 21:29:44,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:44,613 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:29:44,628 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:29:44,628 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:29:44,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:44,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067456207] [2023-12-24 21:29:44,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067456207] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:29:44,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:29:44,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2023-12-24 21:29:44,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427245668] [2023-12-24 21:29:44,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:29:44,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 21:29:44,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:44,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 21:29:44,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-24 21:29:44,650 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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:29:45,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:45,358 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2023-12-24 21:29:45,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 21:29:45,359 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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:29:45,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:45,359 INFO L225 Difference]: With dead ends: 43 [2023-12-24 21:29:45,359 INFO L226 Difference]: Without dead ends: 35 [2023-12-24 21:29:45,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-24 21:29:45,360 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:45,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 80 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 21:29:45,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-24 21:29:45,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-24 21:29:45,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 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:29:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2023-12-24 21:29:45,365 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 24 [2023-12-24 21:29:45,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:45,365 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2023-12-24 21:29:45,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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:29:45,365 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2023-12-24 21:29:45,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-24 21:29:45,365 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:45,366 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:45,372 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 (9)] Ended with exit code 0 [2023-12-24 21:29:45,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:29:45,573 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:45,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:45,573 INFO L85 PathProgramCache]: Analyzing trace with hash 426014518, now seen corresponding path program 2 times [2023-12-24 21:29:45,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:45,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961822668] [2023-12-24 21:29:45,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:29:45,578 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:29:45,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:45,579 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:29:45,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-24 21:29:45,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:29:45,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:29:45,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 21:29:45,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:45,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-24 21:29:45,773 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:46,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-24 21:29:46,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:46,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961822668] [2023-12-24 21:29:46,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961822668] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:29:46,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:29:46,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-24 21:29:46,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446273848] [2023-12-24 21:29:46,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:29:46,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 21:29:46,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:46,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 21:29:46,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-24 21:29:46,436 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 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:29:46,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:46,512 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2023-12-24 21:29:46,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 21:29:46,512 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-24 21:29:46,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:46,513 INFO L225 Difference]: With dead ends: 40 [2023-12-24 21:29:46,513 INFO L226 Difference]: Without dead ends: 27 [2023-12-24 21:29:46,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-12-24 21:29:46,513 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:46,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 72 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:29:46,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-24 21:29:46,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-24 21:29:46,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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:29:46,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-12-24 21:29:46,516 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 24 [2023-12-24 21:29:46,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:46,517 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-12-24 21:29:46,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 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:29:46,517 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-12-24 21:29:46,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-24 21:29:46,517 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:46,517 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:46,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-24 21:29:46,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:29:46,722 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:46,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:46,723 INFO L85 PathProgramCache]: Analyzing trace with hash -524122119, now seen corresponding path program 1 times [2023-12-24 21:29:46,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:46,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866419876] [2023-12-24 21:29:46,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:46,723 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:29:46,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:46,725 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:29:46,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-24 21:29:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:46,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-24 21:29:46,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:46,926 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:29:46,955 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:29:46,956 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:29:46,990 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:29:47,033 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:29:47,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-24 21:29:47,132 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:29:47,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-24 21:29:47,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-12-24 21:29:47,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 35 [2023-12-24 21:29:47,367 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-24 21:29:47,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 46 [2023-12-24 21:29:47,409 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 49 treesize of output 32 [2023-12-24 21:29:47,440 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 36 treesize of output 20 [2023-12-24 21:29:47,470 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 24 treesize of output 12 [2023-12-24 21:29:47,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:29:47,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:47,942 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_704 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_706 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse1 (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_704) .cse0)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)))) (store (store (store |c_#memory_$Pointer$#1.base| .cse0 (store .cse1 .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_706) (select .cse1 .cse2) v_ArrVal_708))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-12-24 21:29:47,975 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 75 treesize of output 55 [2023-12-24 21:29:47,982 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 59 treesize of output 43 [2023-12-24 21:29:52,154 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_708 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_node_create_~temp~0#1.base_19| (_ BitVec 32)) (v_ArrVal_704 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_706 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (select (let ((.cse0 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_19| v_ArrVal_704) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 |v_ULTIMATE.start_node_create_~temp~0#1.base_19|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_19| v_ArrVal_706) (select .cse0 .cse1) v_ArrVal_708)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_19|))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_19| (_ bv0 32)))) is different from false [2023-12-24 21:29:52,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:29:52,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 288 treesize of output 219 [2023-12-24 21:29:52,330 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 319 treesize of output 289 [2023-12-24 21:29:52,339 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 112 treesize of output 108 [2023-12-24 21:29:52,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 92 [2023-12-24 21:29:52,347 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 92 treesize of output 84 [2023-12-24 21:29:52,359 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 84 treesize of output 80 [2023-12-24 21:30:04,629 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-24 21:30:04,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:30:04,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866419876] [2023-12-24 21:30:04,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [866419876] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:30:04,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:30:04,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2023-12-24 21:30:04,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827367790] [2023-12-24 21:30:04,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:30:04,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-24 21:30:04,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:30:04,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-24 21:30:04,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=519, Unknown=59, NotChecked=98, Total=756 [2023-12-24 21:30:04,631 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:30:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:30:10,079 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2023-12-24 21:30:10,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 21:30:10,080 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-24 21:30:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:30:10,080 INFO L225 Difference]: With dead ends: 38 [2023-12-24 21:30:10,080 INFO L226 Difference]: Without dead ends: 35 [2023-12-24 21:30:10,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=132, Invalid=800, Unknown=68, NotChecked=122, Total=1122 [2023-12-24 21:30:10,081 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 38 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 11 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-24 21:30:10,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 122 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 380 Invalid, 3 Unknown, 71 Unchecked, 4.9s Time] [2023-12-24 21:30:10,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-24 21:30:10,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2023-12-24 21:30:10,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:30:10,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-12-24 21:30:10,107 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 25 [2023-12-24 21:30:10,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:30:10,107 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-12-24 21:30:10,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:30:10,107 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-12-24 21:30:10,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-24 21:30:10,107 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:30:10,107 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:30:10,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-24 21:30:10,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:30:10,308 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:30:10,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:30:10,309 INFO L85 PathProgramCache]: Analyzing trace with hash -524120445, now seen corresponding path program 1 times [2023-12-24 21:30:10,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:30:10,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233278379] [2023-12-24 21:30:10,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:30:10,309 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:30:10,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:30:10,316 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:30:10,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-24 21:30:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:30:10,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-24 21:30:10,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:30:10,643 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:30:10,704 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:30:10,704 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:30:10,759 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:30:10,811 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:30:10,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-24 21:30:10,966 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:30:10,966 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 32 treesize of output 34 [2023-12-24 21:30:11,137 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:30:11,144 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 37 treesize of output 26 [2023-12-24 21:30:11,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:11,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2023-12-24 21:30:11,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 35 [2023-12-24 21:30:11,426 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-24 21:30:11,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 84 [2023-12-24 21:30:11,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2023-12-24 21:30:11,443 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 15 [2023-12-24 21:30:11,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 49 treesize of output 19 [2023-12-24 21:30:11,520 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 52 treesize of output 35 [2023-12-24 21:30:11,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-12-24 21:30:11,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-24 21:30:11,630 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 50 treesize of output 30 [2023-12-24 21:30:11,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-24 21:30:11,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-24 21:30:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:30:11,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:30:11,911 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_806) .cse0) .cse1))))) is different from false [2023-12-24 21:30:11,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:11,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 77 [2023-12-24 21:30:11,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:11,972 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 286 treesize of output 285 [2023-12-24 21:30:11,983 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 262 treesize of output 246 [2023-12-24 21:30:11,995 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 126 treesize of output 118 [2023-12-24 21:30:18,237 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse18 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (= .cse4 |c_ULTIMATE.start_dll_insert_~last~0#1.base|))) (let ((.cse11 (not .cse9)) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse5 (bvadd (_ bv4 32) .cse18)) (.cse6 (bvadd |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| (_ bv8 32))) (.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (.cse0 (= .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (let ((.cse10 (and (forall ((v_arrayElimCell_65 (_ BitVec 32)) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select (store (store .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 v_arrayElimCell_65)) (forall ((v_arrayElimCell_67 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 v_arrayElimCell_67))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 v_arrayElimCell_68))))) (not (= v_ArrVal_800 (store (store (select .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7))))))) (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_65 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (let ((.cse25 (select (store (store .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 v_arrayElimCell_65)) (not (= v_ArrVal_800 (store (store (select .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 v_arrayElimCell_68)))))) .cse9) (or .cse11 (forall ((v_arrayElimCell_65 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_67 (_ BitVec 32)) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (let ((.cse27 (select (store (store .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 v_arrayElimCell_65)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 v_arrayElimCell_67)) (not (= v_ArrVal_800 (store (store (select .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7))))))))) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 32)) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (or (not (= v_ArrVal_800 (store (store (select .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7)))) (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select (store (store .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 v_arrayElimCell_65)) (forall ((v_arrayElimCell_67 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 v_arrayElimCell_67))))))))) (or (forall ((v_arrayElimCell_65 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse31 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)) v_arrayElimCell_65)) (not (= v_ArrVal_800 (store (store (select .cse31 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7))))))) .cse9)) .cse0)))) (and (or .cse0 (and (forall ((v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (or (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (forall ((v_arrayElimCell_67 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 v_arrayElimCell_67)))))) (not (= v_ArrVal_800 (store (store (select .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7))))))) (or (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (not (= v_ArrVal_800 (store (store (select .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7))))))) .cse9))) (or (= .cse4 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse10) (or .cse11 (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_67 (_ BitVec 32)) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)) v_arrayElimCell_67)) (not (= v_ArrVal_800 (store (store (select .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7)))))))) (or (and (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (or (not (= v_ArrVal_800 (store (store (select .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)) v_arrayElimCell_68))))) .cse9) (forall ((v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select (store (store .cse15 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)))) (or (forall ((v_arrayElimCell_67 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 v_arrayElimCell_67))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 v_arrayElimCell_68))))) (not (= v_ArrVal_800 (store (store (select .cse15 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7)))))))) (not .cse0)) (or .cse11 (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_67 (_ BitVec 32)) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (let ((.cse16 (select (store (store .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 v_arrayElimCell_67)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (not (= v_ArrVal_800 (store (store (select .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7))))))))) (or (= .cse18 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) .cse10) (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (let ((.cse19 (select (store (store .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (not (= v_ArrVal_800 (store (store (select .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse19 v_arrayElimCell_68)))))) .cse9) (forall ((v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (or (not (= v_ArrVal_800 (store (store (select .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7)))) (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select (store (store .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (forall ((v_arrayElimCell_67 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse22 v_arrayElimCell_67))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse22 v_arrayElimCell_68))))))))))))) is different from false [2023-12-24 21:30:22,262 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse18 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (= .cse4 |c_ULTIMATE.start_dll_insert_~last~0#1.base|))) (let ((.cse11 (not .cse9)) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse5 (bvadd (_ bv4 32) .cse18)) (.cse6 (bvadd |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| (_ bv8 32))) (.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (.cse0 (= .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (let ((.cse10 (and (forall ((v_arrayElimCell_65 (_ BitVec 32)) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select (store (store .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 v_arrayElimCell_65)) (forall ((v_arrayElimCell_67 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 v_arrayElimCell_67))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 v_arrayElimCell_68))))) (not (= v_ArrVal_800 (store (store (select .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7))))))) (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_65 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (let ((.cse25 (select (store (store .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 v_arrayElimCell_65)) (not (= v_ArrVal_800 (store (store (select .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 v_arrayElimCell_68)))))) .cse9) (or .cse11 (forall ((v_arrayElimCell_65 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_67 (_ BitVec 32)) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (let ((.cse27 (select (store (store .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 v_arrayElimCell_65)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 v_arrayElimCell_67)) (not (= v_ArrVal_800 (store (store (select .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7))))))))) (or (and (forall ((v_arrayElimCell_65 (_ BitVec 32)) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (or (not (= v_ArrVal_800 (store (store (select .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7)))) (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select (store (store .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 v_arrayElimCell_65)) (forall ((v_arrayElimCell_67 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 v_arrayElimCell_67))))))))) (or (forall ((v_arrayElimCell_65 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse31 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)) v_arrayElimCell_65)) (not (= v_ArrVal_800 (store (store (select .cse31 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7))))))) .cse9)) .cse0)))) (and (or .cse0 (and (forall ((v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (or (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (forall ((v_arrayElimCell_67 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 v_arrayElimCell_67)))))) (not (= v_ArrVal_800 (store (store (select .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7))))))) (or (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (not (= v_ArrVal_800 (store (store (select .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7))))))) .cse9))) (or (= .cse4 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse10) (or .cse11 (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_67 (_ BitVec 32)) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)) v_arrayElimCell_67)) (not (= v_ArrVal_800 (store (store (select .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7)))))))) (or (and (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (or (not (= v_ArrVal_800 (store (store (select .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)) v_arrayElimCell_68))))) .cse9) (forall ((v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select (store (store .cse15 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)))) (or (forall ((v_arrayElimCell_67 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 v_arrayElimCell_67))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 v_arrayElimCell_68))))) (not (= v_ArrVal_800 (store (store (select .cse15 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7)))))))) (not .cse0)) (or .cse11 (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_67 (_ BitVec 32)) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (let ((.cse16 (select (store (store .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 v_arrayElimCell_67)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (not (= v_ArrVal_800 (store (store (select .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7))))))))) (or (= .cse18 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) .cse10) (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (let ((.cse19 (select (store (store .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (not (= v_ArrVal_800 (store (store (select .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse19 v_arrayElimCell_68)))))) .cse9) (forall ((v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_798))) (or (not (= v_ArrVal_800 (store (store (select .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_800 .cse6)) .cse7 (select v_ArrVal_800 .cse7)))) (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select (store (store .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_808) (select (select (store (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_807) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (forall ((v_arrayElimCell_67 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse22 v_arrayElimCell_67))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse22 v_arrayElimCell_68))))))))))))) is different from true [2023-12-24 21:30:29,448 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse33 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse34 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_insert_~last~0#1.offset|))) (let ((.cse4 (select .cse33 .cse34)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse23 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (= .cse4 .cse6))) (let ((.cse13 (not .cse12)) (.cse8 (= .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) (.cse1 (bvadd |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| (_ bv8 32))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse33 .cse34 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse7 (bvadd (_ bv4 32) .cse23))) (let ((.cse22 (and (or .cse13 (forall ((v_arrayElimCell_65 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_67 (_ BitVec 32)) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_798))) (let ((.cse24 (select (store (store .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) .cse4 v_ArrVal_808) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) .cse4 v_ArrVal_807) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 v_arrayElimCell_65)) (not (= v_ArrVal_800 (store (store (select .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_800 .cse1)) .cse2 (select v_ArrVal_800 .cse2)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 v_arrayElimCell_67))))))) (or (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_arrayElimCell_65 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_798))) (let ((.cse26 (select (store (store .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) .cse4 v_ArrVal_808) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) .cse4 v_ArrVal_807) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse26 v_arrayElimCell_65)) (not (= v_ArrVal_800 (store (store (select .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_800 .cse1)) .cse2 (select v_ArrVal_800 .cse2)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse26 v_arrayElimCell_68)))))) .cse12) (forall ((v_arrayElimCell_65 (_ BitVec 32)) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_798))) (or (not (= v_ArrVal_800 (store (store (select .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_800 .cse1)) .cse2 (select v_ArrVal_800 .cse2)))) (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (select (store (store .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) .cse4 v_ArrVal_808) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) .cse4 v_ArrVal_807) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 v_arrayElimCell_65)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 v_arrayElimCell_68)) (forall ((v_arrayElimCell_67 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 v_arrayElimCell_67))))))))) (or .cse8 (and (or .cse12 (forall ((v_arrayElimCell_65 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_798))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse30 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) .cse4 v_ArrVal_808) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) .cse4 v_ArrVal_807) .cse6) .cse7)) v_arrayElimCell_65)) (not (= v_ArrVal_800 (store (store (select .cse30 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_800 .cse1)) .cse2 (select v_ArrVal_800 .cse2)))))))) (forall ((v_arrayElimCell_65 (_ BitVec 32)) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_798))) (or (not (= v_ArrVal_800 (store (store (select .cse31 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_800 .cse1)) .cse2 (select v_ArrVal_800 .cse2)))) (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (select (store (store .cse31 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) .cse4 v_ArrVal_808) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) .cse4 v_ArrVal_807) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse32 v_arrayElimCell_65)) (forall ((v_arrayElimCell_67 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse32 v_arrayElimCell_67)))))))))))))) (and (forall ((v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_798))) (or (not (= v_ArrVal_800 (store (store (select .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_800 .cse1)) .cse2 (select v_ArrVal_800 .cse2)))) (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (store (store .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) .cse4 v_ArrVal_808) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) .cse4 v_ArrVal_807) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 v_arrayElimCell_68)) (forall ((v_arrayElimCell_67 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 v_arrayElimCell_67))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))))))) (or .cse8 (and (forall ((v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_798))) (or (not (= v_ArrVal_800 (store (store (select .cse9 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_800 .cse1)) .cse2 (select v_ArrVal_800 .cse2)))) (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (store (store .cse9 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) .cse4 v_ArrVal_808) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) .cse4 v_ArrVal_807) .cse6) .cse7)))) (or (forall ((v_arrayElimCell_67 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 v_arrayElimCell_67))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))))))) (or (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_798))) (or (not (= v_ArrVal_800 (store (store (select .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_800 .cse1)) .cse2 (select v_ArrVal_800 .cse2)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) .cse4 v_ArrVal_808) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) .cse4 v_ArrVal_807) .cse6) .cse7)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))) .cse12))) (or .cse13 (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_67 (_ BitVec 32)) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_798))) (or (not (= v_ArrVal_800 (store (store (select .cse14 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_800 .cse1)) .cse2 (select v_ArrVal_800 .cse2)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse14 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) .cse4 v_ArrVal_808) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) .cse4 v_ArrVal_807) .cse6) .cse7)) v_arrayElimCell_67)))))) (or .cse13 (forall ((v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_67 (_ BitVec 32)) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_798))) (let ((.cse16 (select (store (store .cse15 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) .cse4 v_ArrVal_808) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) .cse4 v_ArrVal_807) .cse6) .cse7)))) (or (not (= v_ArrVal_800 (store (store (select .cse15 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_800 .cse1)) .cse2 (select v_ArrVal_800 .cse2)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 v_arrayElimCell_67)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))))) (or .cse12 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_798))) (let ((.cse18 (select (store (store .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) .cse4 v_ArrVal_808) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) .cse4 v_ArrVal_807) .cse6) .cse7)))) (or (not (= v_ArrVal_800 (store (store (select .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_800 .cse1)) .cse2 (select v_ArrVal_800 .cse2)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 v_arrayElimCell_68)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))))) (or (and (forall ((v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_798))) (or (not (= v_ArrVal_800 (store (store (select .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_800 .cse1)) .cse2 (select v_ArrVal_800 .cse2)))) (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select (store (store .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) .cse4 v_ArrVal_808) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) .cse4 v_ArrVal_807) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 v_arrayElimCell_68)) (forall ((v_arrayElimCell_67 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 v_arrayElimCell_67))))))))) (or .cse12 (forall ((v_arrayElimCell_68 (_ BitVec 32)) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_798))) (or (not (= v_ArrVal_800 (store (store (select .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_800 .cse1)) .cse2 (select v_ArrVal_800 .cse2)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_800) .cse4 v_ArrVal_808) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_802) .cse4 v_ArrVal_807) .cse6) .cse7)) v_arrayElimCell_68))))))) (not .cse8)) (or (= .cse6 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse22) (or (= .cse23 |c_ULTIMATE.start_dll_insert_~last~0#1.offset|) .cse22))))))) is different from false [2023-12-24 21:30:30,569 INFO L349 Elim1Store]: treesize reduction 278, result has 52.0 percent of original size [2023-12-24 21:30:30,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 20594 treesize of output 19830 [2023-12-24 21:30:30,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:30,704 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 2151 treesize of output 2143 [2023-12-24 21:30:30,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:30,812 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 357 treesize of output 295 [2023-12-24 21:30:31,508 INFO L349 Elim1Store]: treesize reduction 76, result has 48.3 percent of original size [2023-12-24 21:30:31,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1129 treesize of output 1177 [2023-12-24 21:30:33,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:33,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 61 [2023-12-24 21:30:33,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2023-12-24 21:30:37,011 INFO L349 Elim1Store]: treesize reduction 92, result has 45.6 percent of original size [2023-12-24 21:30:37,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 1451 treesize of output 1503 [2023-12-24 21:30:41,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:41,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 1978 treesize of output 2010 [2023-12-24 21:30:46,525 INFO L224 Elim1Store]: Index analysis took 136 ms [2023-12-24 21:30:46,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:46,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 1978 treesize of output 2010 [2023-12-24 21:30:53,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2023-12-24 21:30:54,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:54,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 3586 treesize of output 3608 [2023-12-24 21:30:59,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:59,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 2288 treesize of output 2472 [2023-12-24 21:31:24,193 INFO L349 Elim1Store]: treesize reduction 556, result has 35.9 percent of original size [2023-12-24 21:31:24,193 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 30871 treesize of output 29590 [2023-12-24 21:31:24,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:31:24,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3226 treesize of output 3226 [2023-12-24 21:31:24,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:31:24,648 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 360 treesize of output 234 [2023-12-24 21:31:24,782 INFO L224 Elim1Store]: Index analysis took 105 ms [2023-12-24 21:31:25,412 INFO L349 Elim1Store]: treesize reduction 92, result has 45.6 percent of original size [2023-12-24 21:31:25,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 1662 treesize of output 1714 [2023-12-24 21:31:31,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:31:31,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 61 [2023-12-24 21:31:31,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 Received shutdown request... [2023-12-24 21:44:09,094 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 21:44:09,097 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 (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 21:44:09,339 WARN L235 SmtUtils]: Removed 545 from assertion stack [2023-12-24 21:44:09,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 21:44:09,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-24 21:44:09,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:44:09,548 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 26 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6592 for 741105ms.. [2023-12-24 21:44:09,552 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:44:09,553 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 21:44:09,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 09:44:09 BoogieIcfgContainer [2023-12-24 21:44:09,555 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 21:44:09,555 INFO L158 Benchmark]: Toolchain (without parser) took 882069.78ms. Allocated memory was 286.3MB in the beginning and 343.9MB in the end (delta: 57.7MB). Free memory was 234.3MB in the beginning and 291.8MB in the end (delta: -57.5MB). Peak memory consumption was 203.4MB. Max. memory is 8.0GB. [2023-12-24 21:44:09,555 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 220.2MB. Free memory is still 171.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 21:44:09,555 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.03ms. Allocated memory is still 286.3MB. Free memory was 234.3MB in the beginning and 214.7MB in the end (delta: 19.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-24 21:44:09,555 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.59ms. Allocated memory is still 286.3MB. Free memory was 214.7MB in the beginning and 212.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 21:44:09,556 INFO L158 Benchmark]: Boogie Preprocessor took 48.56ms. Allocated memory is still 286.3MB. Free memory was 212.1MB in the beginning and 208.7MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 21:44:09,556 INFO L158 Benchmark]: RCFGBuilder took 572.90ms. Allocated memory is still 286.3MB. Free memory was 208.6MB in the beginning and 235.4MB in the end (delta: -26.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-24 21:44:09,556 INFO L158 Benchmark]: TraceAbstraction took 881044.86ms. Allocated memory was 286.3MB in the beginning and 343.9MB in the end (delta: 57.7MB). Free memory was 234.9MB in the beginning and 291.8MB in the end (delta: -57.0MB). Peak memory consumption was 203.4MB. Max. memory is 8.0GB. [2023-12-24 21:44:09,557 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.11ms. Allocated memory is still 220.2MB. Free memory is still 171.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 360.03ms. Allocated memory is still 286.3MB. Free memory was 234.3MB in the beginning and 214.7MB in the end (delta: 19.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.59ms. Allocated memory is still 286.3MB. Free memory was 214.7MB in the beginning and 212.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.56ms. Allocated memory is still 286.3MB. Free memory was 212.1MB in the beginning and 208.7MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 572.90ms. Allocated memory is still 286.3MB. Free memory was 208.6MB in the beginning and 235.4MB in the end (delta: -26.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 881044.86ms. Allocated memory was 286.3MB in the beginning and 343.9MB in the end (delta: 57.7MB). Free memory was 234.9MB in the beginning and 291.8MB in the end (delta: -57.0MB). Peak memory consumption was 203.4MB. 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: 654]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 654). Cancelled while NwaCegarLoop was analyzing trace of length 26 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6592 for 741105ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 881.0s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 176 SdHoareTripleChecker+Valid, 10.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 799 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 303 IncrementalHoareTripleChecker+Unchecked, 602 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1051 IncrementalHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 197 mSDtfsCounter, 1051 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 325 GetRequests, 221 SyntacticMatches, 6 SemanticMatches, 98 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 25.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=7, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 34 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 26.7s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 297 ConstructedInterpolants, 34 QuantifiedInterpolants, 3516 SizeOfPredicates, 76 NumberOfNonLiveVariables, 1788 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 60/88 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