/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-16 16:20:16,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:20:16,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 16:20:16,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:20:16,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:20:16,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:20:16,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:20:16,602 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:20:16,603 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:20:16,607 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:20:16,607 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:20:16,608 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:20:16,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:20:16,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:20:16,609 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:20:16,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:20:16,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:20:16,610 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:20:16,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:20:16,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:20:16,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:20:16,611 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:20:16,611 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:20:16,611 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:20:16,612 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:20:16,612 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:20:16,612 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:20:16,612 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:20:16,612 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:20:16,612 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:20:16,613 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:20:16,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:20:16,614 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:20:16,614 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:20:16,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:20:16,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:20:16,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:20:16,614 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:20:16,614 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:20:16,615 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:20:16,615 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:20:16,615 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:20:16,615 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:20:16,615 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:20:16,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:20:16,616 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:20:16,616 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 16:20:16,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:20:16,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:20:16,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:20:16,840 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:20:16,843 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:20:16,844 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-16 16:20:17,908 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:20:18,110 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:20:18,111 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_insert_equal.i [2023-12-16 16:20:18,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd747e66f/6a2100eb12d7420b86e2c354318d87a0/FLAGfd2aaa952 [2023-12-16 16:20:18,147 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd747e66f/6a2100eb12d7420b86e2c354318d87a0 [2023-12-16 16:20:18,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:20:18,150 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:20:18,151 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:20:18,151 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:20:18,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:20:18,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:20:18" (1/1) ... [2023-12-16 16:20:18,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d600626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:18, skipping insertion in model container [2023-12-16 16:20:18,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:20:18" (1/1) ... [2023-12-16 16:20:18,198 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:20:18,496 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-16 16:20:18,499 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:20:18,508 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:20:18,582 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-16 16:20:18,583 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:20:18,603 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:20:18,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:18 WrapperNode [2023-12-16 16:20:18,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:20:18,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:20:18,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:20:18,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:20:18,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:18" (1/1) ... [2023-12-16 16:20:18,625 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:18" (1/1) ... [2023-12-16 16:20:18,642 INFO L138 Inliner]: procedures = 130, calls = 44, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 139 [2023-12-16 16:20:18,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:20:18,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:20:18,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:20:18,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:20:18,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:18" (1/1) ... [2023-12-16 16:20:18,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:18" (1/1) ... [2023-12-16 16:20:18,659 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:18" (1/1) ... [2023-12-16 16:20:18,680 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 8, 17]. 63 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 14 writes are split as follows [0, 1, 13]. [2023-12-16 16:20:18,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:18" (1/1) ... [2023-12-16 16:20:18,681 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:18" (1/1) ... [2023-12-16 16:20:18,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:18" (1/1) ... [2023-12-16 16:20:18,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:18" (1/1) ... [2023-12-16 16:20:18,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:18" (1/1) ... [2023-12-16 16:20:18,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:18" (1/1) ... [2023-12-16 16:20:18,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:20:18,697 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:20:18,697 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:20:18,697 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:20:18,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:18" (1/1) ... [2023-12-16 16:20:18,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:20:18,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:20:18,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 16:20:18,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 16:20:18,759 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-16 16:20:18,759 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-16 16:20:18,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 16:20:18,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 16:20:18,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-16 16:20:18,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 16:20:18,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:20:18,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 16:20:18,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-16 16:20:18,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-16 16:20:18,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-16 16:20:18,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-16 16:20:18,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-16 16:20:18,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-16 16:20:18,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 16:20:18,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 16:20:18,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 16:20:18,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-16 16:20:18,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-16 16:20:18,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-16 16:20:18,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-16 16:20:18,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:20:18,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 16:20:18,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 16:20:18,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:20:18,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:20:18,883 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:20:18,886 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:20:18,911 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-16 16:20:19,275 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:20:19,296 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:20:19,297 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-16 16:20:19,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:20:19 BoogieIcfgContainer [2023-12-16 16:20:19,297 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:20:19,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:20:19,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:20:19,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:20:19,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:20:18" (1/3) ... [2023-12-16 16:20:19,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ceac2b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:20:19, skipping insertion in model container [2023-12-16 16:20:19,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:18" (2/3) ... [2023-12-16 16:20:19,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ceac2b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:20:19, skipping insertion in model container [2023-12-16 16:20:19,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:20:19" (3/3) ... [2023-12-16 16:20:19,303 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_equal.i [2023-12-16 16:20:19,315 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:20:19,315 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:20:19,344 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:20:19,348 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;@17766504, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:20:19,348 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:20:19,351 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-16 16:20:19,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 16:20:19,356 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:20:19,356 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:20:19,357 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:20:19,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:20:19,360 INFO L85 PathProgramCache]: Analyzing trace with hash 342889473, now seen corresponding path program 1 times [2023-12-16 16:20:19,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:20:19,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [531660075] [2023-12-16 16:20:19,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:20:19,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:19,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:20:19,375 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:20:19,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 16:20:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:20:19,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 16:20:19,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:20:19,524 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:20:19,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:20:19,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [531660075] [2023-12-16 16:20:19,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [531660075] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:20:19,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:20:19,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:20:19,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958148953] [2023-12-16 16:20:19,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:20:19,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 16:20:19,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:20:19,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 16:20:19,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:20:19,558 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-16 16:20:19,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:20:19,607 INFO L93 Difference]: Finished difference Result 49 states and 75 transitions. [2023-12-16 16:20:19,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 16:20:19,608 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-16 16:20:19,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:20:19,613 INFO L225 Difference]: With dead ends: 49 [2023-12-16 16:20:19,613 INFO L226 Difference]: Without dead ends: 20 [2023-12-16 16:20:19,615 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-16 16:20:19,618 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-16 16:20:19,619 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-16 16:20:19,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-16 16:20:19,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-16 16:20:19,638 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-16 16:20:19,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2023-12-16 16:20:19,641 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 12 [2023-12-16 16:20:19,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:20:19,642 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2023-12-16 16:20:19,642 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-16 16:20:19,642 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2023-12-16 16:20:19,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 16:20:19,643 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:20:19,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:20:19,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 16:20:19,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:19,847 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:20:19,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:20:19,848 INFO L85 PathProgramCache]: Analyzing trace with hash 125226926, now seen corresponding path program 1 times [2023-12-16 16:20:19,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:20:19,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260921051] [2023-12-16 16:20:19,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:20:19,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:19,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:20:19,851 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:20:19,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 16:20:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:20:20,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 16:20:20,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:20:20,058 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:20:20,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:20:20,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260921051] [2023-12-16 16:20:20,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260921051] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:20:20,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:20:20,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:20:20,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536179819] [2023-12-16 16:20:20,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:20:20,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:20:20,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:20:20,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:20:20,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:20:20,064 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-16 16:20:20,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:20:20,120 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2023-12-16 16:20:20,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:20:20,123 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-16 16:20:20,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:20:20,123 INFO L225 Difference]: With dead ends: 39 [2023-12-16 16:20:20,123 INFO L226 Difference]: Without dead ends: 25 [2023-12-16 16:20:20,124 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-16 16:20:20,124 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.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:20:20,125 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.0s Time] [2023-12-16 16:20:20,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-16 16:20:20,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2023-12-16 16:20:20,127 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-16 16:20:20,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2023-12-16 16:20:20,128 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 12 [2023-12-16 16:20:20,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:20:20,128 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2023-12-16 16:20:20,128 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-16 16:20:20,128 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2023-12-16 16:20:20,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 16:20:20,128 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:20:20,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:20:20,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-16 16:20:20,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:20,333 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:20:20,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:20:20,334 INFO L85 PathProgramCache]: Analyzing trace with hash -590731374, now seen corresponding path program 1 times [2023-12-16 16:20:20,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:20:20,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195065918] [2023-12-16 16:20:20,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:20:20,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:20,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:20:20,336 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:20:20,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 16:20:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:20:20,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:20:20,478 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:20,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:20:20,514 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:20:20,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:20:20,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195065918] [2023-12-16 16:20:20,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195065918] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:20:20,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:20:20,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:20:20,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125058642] [2023-12-16 16:20:20,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:20:20,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:20:20,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:20:20,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:20:20,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:20:20,520 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-16 16:20:20,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:20:20,623 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2023-12-16 16:20:20,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:20:20,626 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-16 16:20:20,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:20:20,626 INFO L225 Difference]: With dead ends: 44 [2023-12-16 16:20:20,626 INFO L226 Difference]: Without dead ends: 25 [2023-12-16 16:20:20,626 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-16 16:20:20,627 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-16 16:20:20,627 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-16 16:20:20,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-16 16:20:20,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2023-12-16 16:20:20,630 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-16 16:20:20,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-16 16:20:20,630 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 17 [2023-12-16 16:20:20,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:20:20,631 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-16 16:20:20,631 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-16 16:20:20,631 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-16 16:20:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 16:20:20,631 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:20:20,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:20:20,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 16:20:20,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:20,835 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:20:20,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:20:20,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1177537388, now seen corresponding path program 1 times [2023-12-16 16:20:20,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:20:20,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044201465] [2023-12-16 16:20:20,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:20:20,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:20,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:20:20,837 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:20:20,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 16:20:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:20:20,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:20:20,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:20,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:20:20,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:20:20,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:20:20,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:20:20,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044201465] [2023-12-16 16:20:20,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044201465] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:20:20,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:20:20,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-16 16:20:20,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242172003] [2023-12-16 16:20:20,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:20:20,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:20:20,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:20:20,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:20:20,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:20:20,991 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-16 16:20:21,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:20:21,115 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2023-12-16 16:20:21,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 16:20:21,118 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-16 16:20:21,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:20:21,119 INFO L225 Difference]: With dead ends: 44 [2023-12-16 16:20:21,119 INFO L226 Difference]: Without dead ends: 30 [2023-12-16 16:20:21,119 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-16 16:20:21,120 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-16 16:20:21,120 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-16 16:20:21,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-16 16:20:21,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2023-12-16 16:20:21,123 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-16 16:20:21,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-12-16 16:20:21,124 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 17 [2023-12-16 16:20:21,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:20:21,124 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-12-16 16:20:21,124 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-16 16:20:21,124 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-12-16 16:20:21,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 16:20:21,124 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:20:21,125 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-16 16:20:21,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 16:20:21,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:21,329 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:20:21,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:20:21,329 INFO L85 PathProgramCache]: Analyzing trace with hash -416685460, now seen corresponding path program 1 times [2023-12-16 16:20:21,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:20:21,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132054754] [2023-12-16 16:20:21,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:20:21,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:21,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:20:21,331 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:20:21,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 16:20:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:20:21,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 16:20:21,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:21,494 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 16:20:21,494 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:20:21,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:20:21,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132054754] [2023-12-16 16:20:21,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132054754] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:20:21,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:20:21,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 16:20:21,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068233687] [2023-12-16 16:20:21,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:20:21,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:20:21,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:20:21,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:20:21,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:20:21,496 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-16 16:20:21,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:20:21,547 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2023-12-16 16:20:21,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:20:21,548 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-16 16:20:21,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:20:21,548 INFO L225 Difference]: With dead ends: 37 [2023-12-16 16:20:21,548 INFO L226 Difference]: Without dead ends: 27 [2023-12-16 16:20:21,549 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-16 16:20:21,549 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-16 16:20:21,550 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-16 16:20:21,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-16 16:20:21,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-16 16:20:21,553 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-16 16:20:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2023-12-16 16:20:21,553 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 22 [2023-12-16 16:20:21,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:20:21,553 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2023-12-16 16:20:21,553 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-16 16:20:21,553 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2023-12-16 16:20:21,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 16:20:21,554 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:20:21,554 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:20:21,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 16:20:21,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:21,775 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:20:21,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:20:21,776 INFO L85 PathProgramCache]: Analyzing trace with hash 549172958, now seen corresponding path program 1 times [2023-12-16 16:20:21,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:20:21,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080104563] [2023-12-16 16:20:21,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:20:21,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:21,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:20:21,777 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:20:21,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 16:20:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:20:21,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:20:21,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:22,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-16 16:20:22,010 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-16 16:20:22,010 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:20:22,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:20:22,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080104563] [2023-12-16 16:20:22,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080104563] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:20:22,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:20:22,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 16:20:22,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769192629] [2023-12-16 16:20:22,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:20:22,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:20:22,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:20:22,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:20:22,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:20:22,011 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-16 16:20:22,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:20:22,508 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2023-12-16 16:20:22,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 16:20:22,512 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-16 16:20:22,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:20:22,513 INFO L225 Difference]: With dead ends: 57 [2023-12-16 16:20:22,513 INFO L226 Difference]: Without dead ends: 37 [2023-12-16 16:20:22,513 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-16 16:20:22,514 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.5s IncrementalHoareTripleChecker+Time [2023-12-16 16:20:22,514 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.5s Time] [2023-12-16 16:20:22,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-16 16:20:22,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2023-12-16 16:20:22,518 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-16 16:20:22,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-12-16 16:20:22,518 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 23 [2023-12-16 16:20:22,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:20:22,519 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-12-16 16:20:22,519 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-16 16:20:22,519 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-12-16 16:20:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 16:20:22,519 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:20:22,519 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:20:22,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 16:20:22,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:22,725 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:20:22,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:20:22,726 INFO L85 PathProgramCache]: Analyzing trace with hash 549174632, now seen corresponding path program 1 times [2023-12-16 16:20:22,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:20:22,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011323015] [2023-12-16 16:20:22,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:20:22,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:22,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:20:22,727 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:20:22,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 16:20:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:20:23,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-16 16:20:23,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:23,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-16 16:20:23,133 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-16 16:20:23,134 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-16 16:20:23,222 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-16 16:20:23,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-16 16:20:23,354 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-16 16:20:23,355 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 52 treesize of output 47 [2023-12-16 16:20:23,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-16 16:20:23,506 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-16 16:20:23,507 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-16 16:20:23,620 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-16 16:20:23,646 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-16 16:20:23,774 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 40 treesize of output 16 [2023-12-16 16:20:23,927 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 59 treesize of output 26 [2023-12-16 16:20:23,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-12-16 16:20:23,984 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-16 16:20:24,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 16:20:24,094 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-16 16:20:24,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:20:24,275 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_456 (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse0 (select v_ArrVal_456 .cse0))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_458) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-12-16 16:20:24,342 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_insert_~last~0#1.offset|))) (or (not (= v_ArrVal_456 (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0 (select v_ArrVal_456 .cse0)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_457) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0) v_ArrVal_458) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-12-16 16:20:24,625 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-16 16:20:24,633 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-16 16:20:24,660 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (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_458 (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#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_453) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0 (select v_ArrVal_456 .cse0)) v_ArrVal_456)) (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#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_456) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_457) (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_451) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0) v_ArrVal_458) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))))) is different from false [2023-12-16 16:20:24,724 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (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_458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (or (not (= v_ArrVal_456 (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_453) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_456 .cse0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) (_ bv0 1))) (= (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_456) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_457) (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_451) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) v_ArrVal_458) |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|)))) is different from false [2023-12-16 16:20:24,775 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (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_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_449)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) (_ bv0 1))) (not (= v_ArrVal_456 (store (select (store .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_453) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_456 .cse1)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_456) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_457) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_450) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_451) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_458) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) is different from false [2023-12-16 16:20:24,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:20:24,823 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 46 treesize of output 52 [2023-12-16 16:20:24,835 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 203 treesize of output 201 [2023-12-16 16:20:24,853 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 580 treesize of output 526 [2023-12-16 16:20:24,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:20:24,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 100 [2023-12-16 16:20:24,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:20:24,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2023-12-16 16:20:24,955 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 66 treesize of output 50 [2023-12-16 16:20:24,970 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 50 treesize of output 48 [2023-12-16 16:20:24,984 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 90 treesize of output 86 [2023-12-16 16:20:25,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2023-12-16 16:20:25,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:20:25,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2023-12-16 16:20:25,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-16 16:20:25,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-16 16:20:25,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-16 16:20:25,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-16 16:20:25,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2023-12-16 16:20:25,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-12-16 16:20:26,657 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-16 16:20:26,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:20:26,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011323015] [2023-12-16 16:20:26,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011323015] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:20:26,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:20:26,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2023-12-16 16:20:26,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141578870] [2023-12-16 16:20:26,658 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:20:26,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-16 16:20:26,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:20:26,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-16 16:20:26,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=514, Unknown=18, NotChecked=250, Total=870 [2023-12-16 16:20:26,660 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-16 16:20:32,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:20:32,735 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2023-12-16 16:20:32,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 16:20:32,736 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-16 16:20:32,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:20:32,736 INFO L225 Difference]: With dead ends: 48 [2023-12-16 16:20:32,736 INFO L226 Difference]: Without dead ends: 46 [2023-12-16 16:20:32,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=150, Invalid=782, Unknown=18, NotChecked=310, Total=1260 [2023-12-16 16:20:32,737 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 236 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-12-16 16:20:32,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 206 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 454 Invalid, 0 Unknown, 236 Unchecked, 5.5s Time] [2023-12-16 16:20:32,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-16 16:20:32,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2023-12-16 16:20:32,746 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-16 16:20:32,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2023-12-16 16:20:32,747 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 23 [2023-12-16 16:20:32,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:20:32,747 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2023-12-16 16:20:32,747 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-16 16:20:32,747 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2023-12-16 16:20:32,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 16:20:32,748 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:20:32,748 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-16 16:20:32,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 16:20:32,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:32,950 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:20:32,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:20:32,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1418447905, now seen corresponding path program 1 times [2023-12-16 16:20:32,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:20:32,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419446984] [2023-12-16 16:20:32,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:20:32,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:32,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:20:32,978 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:20:32,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 16:20:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:20:33,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 16:20:33,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:33,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-16 16:20:33,174 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-16 16:20:33,174 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:20:33,197 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-16 16:20:33,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:20:33,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419446984] [2023-12-16 16:20:33,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419446984] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:20:33,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:20:33,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2023-12-16 16:20:33,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208760031] [2023-12-16 16:20:33,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:20:33,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 16:20:33,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:20:33,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 16:20:33,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:20:33,199 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-16 16:20:33,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:20:33,943 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2023-12-16 16:20:33,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:20:33,944 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-16 16:20:33,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:20:33,945 INFO L225 Difference]: With dead ends: 43 [2023-12-16 16:20:33,945 INFO L226 Difference]: Without dead ends: 35 [2023-12-16 16:20:33,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:20:33,947 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-16 16:20:33,947 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-16 16:20:33,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-16 16:20:33,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-16 16:20:33,955 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-16 16:20:33,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2023-12-16 16:20:33,955 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 24 [2023-12-16 16:20:33,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:20:33,955 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2023-12-16 16:20:33,956 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-16 16:20:33,956 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2023-12-16 16:20:33,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 16:20:33,956 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:20:33,956 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-16 16:20:33,961 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-16 16:20:34,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:34,161 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:20:34,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:20:34,161 INFO L85 PathProgramCache]: Analyzing trace with hash 426014518, now seen corresponding path program 2 times [2023-12-16 16:20:34,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:20:34,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467782883] [2023-12-16 16:20:34,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:20:34,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:34,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:20:34,163 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:20:34,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 16:20:34,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:20:34,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:20:34,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 16:20:34,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:34,403 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-16 16:20:34,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:20:35,106 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-16 16:20:35,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:20:35,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467782883] [2023-12-16 16:20:35,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467782883] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:20:35,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:20:35,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-16 16:20:35,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946897800] [2023-12-16 16:20:35,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:20:35,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 16:20:35,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:20:35,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 16:20:35,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:20:35,108 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-16 16:20:35,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:20:35,217 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2023-12-16 16:20:35,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 16:20:35,218 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-16 16:20:35,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:20:35,218 INFO L225 Difference]: With dead ends: 40 [2023-12-16 16:20:35,218 INFO L226 Difference]: Without dead ends: 27 [2023-12-16 16:20:35,218 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-16 16:20:35,219 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:20:35,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 58 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:20:35,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-16 16:20:35,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-16 16:20:35,222 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-16 16:20:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-12-16 16:20:35,222 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 24 [2023-12-16 16:20:35,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:20:35,222 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-12-16 16:20:35,222 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-16 16:20:35,222 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-12-16 16:20:35,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-16 16:20:35,223 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:20:35,223 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-16 16:20:35,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 16:20:35,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:35,427 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:20:35,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:20:35,428 INFO L85 PathProgramCache]: Analyzing trace with hash -524122119, now seen corresponding path program 1 times [2023-12-16 16:20:35,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:20:35,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660583641] [2023-12-16 16:20:35,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:20:35,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:35,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:20:35,429 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:20:35,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-16 16:20:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:20:35,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-16 16:20:35,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:35,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-16 16:20:35,719 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-16 16:20:35,719 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-16 16:20:35,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-12-16 16:20:35,797 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-16 16:20:35,797 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 43 treesize of output 40 [2023-12-16 16:20:35,904 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-16 16:20:35,904 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-16 16:20:36,031 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 48 treesize of output 31 [2023-12-16 16:20:36,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 49 [2023-12-16 16:20:36,264 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-16 16:20:36,265 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 76 treesize of output 51 [2023-12-16 16:20:36,324 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 60 treesize of output 37 [2023-12-16 16:20:36,361 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 47 treesize of output 27 [2023-12-16 16:20:36,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:20:36,400 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 31 treesize of output 15 [2023-12-16 16:20:36,438 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-16 16:20:36,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:20:36,511 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_703 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_703) (select (select |c_#memory_$Pointer$#1.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$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-12-16 16:20:36,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 55 [2023-12-16 16:20:36,912 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-16 16:20:36,926 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_19| (_ BitVec 32)) (v_ArrVal_703 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_699 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_700 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) (select (select (let ((.cse0 (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_19| v_ArrVal_699) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~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_700) (select .cse0 .cse1) v_ArrVal_703)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1)))) (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-16 16:20:36,952 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_19| (_ BitVec 32)) (v_ArrVal_703 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_699 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_700 (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$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_19| v_ArrVal_699) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.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_700) (select .cse0 .cse1) v_ArrVal_703)) |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-16 16:20:37,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:20:37,089 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-16 16:20:37,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:20:37,097 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 329 treesize of output 293 [2023-12-16 16:20:37,105 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 96 [2023-12-16 16:20:37,108 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 96 treesize of output 92 [2023-12-16 16:20:37,112 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-16 16:20:37,115 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-16 16:20:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 1 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-16 16:20:45,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:20:45,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660583641] [2023-12-16 16:20:45,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660583641] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:20:45,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:20:45,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2023-12-16 16:20:45,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221629473] [2023-12-16 16:20:45,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:20:45,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-16 16:20:45,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:20:45,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-16 16:20:45,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=479, Unknown=54, NotChecked=144, Total=756 [2023-12-16 16:20:45,361 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-16 16:20:50,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:20:50,677 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2023-12-16 16:20:50,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 16:20:50,678 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-16 16:20:50,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:20:50,678 INFO L225 Difference]: With dead ends: 38 [2023-12-16 16:20:50,678 INFO L226 Difference]: Without dead ends: 35 [2023-12-16 16:20:50,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=128, Invalid=755, Unknown=59, NotChecked=180, Total=1122 [2023-12-16 16:20:50,679 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 24 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 7 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-12-16 16:20:50,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 116 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 366 Invalid, 6 Unknown, 108 Unchecked, 4.7s Time] [2023-12-16 16:20:50,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-16 16:20:50,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2023-12-16 16:20:50,682 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-16 16:20:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-12-16 16:20:50,683 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 25 [2023-12-16 16:20:50,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:20:50,683 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-12-16 16:20:50,683 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-16 16:20:50,683 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-12-16 16:20:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-16 16:20:50,683 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:20:50,683 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-16 16:20:50,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-16 16:20:50,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:50,887 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:20:50,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:20:50,888 INFO L85 PathProgramCache]: Analyzing trace with hash -524120445, now seen corresponding path program 1 times [2023-12-16 16:20:50,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:20:50,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769098314] [2023-12-16 16:20:50,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:20:50,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:20:50,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:20:50,890 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:20:50,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-16 16:20:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:20:51,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-16 16:20:51,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:20:51,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-16 16:20:51,215 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-16 16:20:51,215 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-16 16:20:51,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-16 16:20:51,301 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-16 16:20:51,301 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-16 16:20:51,421 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-16 16:20:51,421 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-16 16:20:51,551 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-16 16:20:51,571 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 11 treesize of output 7 [2023-12-16 16:20:51,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:20:51,773 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 40 treesize of output 22 [2023-12-16 16:20:51,788 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-16 16:20:51,809 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-16 16:20:51,809 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-16 16:20:51,822 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-16 16:20:51,835 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-16 16:20:51,841 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-16 16:20:51,951 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-16 16:20:51,965 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-16 16:20:51,977 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-16 16:20:52,085 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-16 16:20:52,168 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-16 16:20:52,173 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-16 16:20:52,333 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-16 16:20:52,333 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:20:52,483 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_802 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#1.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$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_803) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_804) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_802) .cse0) .cse1))))) is different from false [2023-12-16 16:20:52,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:20:52,509 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 91 treesize of output 92 [2023-12-16 16:20:52,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:20:52,552 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 346 treesize of output 345 [2023-12-16 16:20:52,560 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 322 treesize of output 306 [2023-12-16 16:20:52,578 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 156 treesize of output 148 [2023-12-16 16:20:58,045 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse6)) (.cse3 (bvadd |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| (_ bv8 32))) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.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|))) (.cse7 (bvadd (_ bv4 32) .cse13)) (.cse9 (= |c_ULTIMATE.start_dll_insert_~last~0#1.base| .cse6))) (let ((.cse12 (and (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_arrayElimCell_75 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_801))) (store .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_796))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_803) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_804) .cse6) .cse7)))) (or (= (select .cse21 v_arrayElimCell_74) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse21 v_arrayElimCell_75)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse21 v_arrayElimCell_72))))) (or (and (or (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse23 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_801))) (store .cse23 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse23 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_796))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_803) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_804) .cse6) .cse7)) v_arrayElimCell_72))) .cse0) (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_801))) (store .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_796))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_803) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_804) .cse6) .cse7)))) (or (forall ((v_arrayElimCell_75 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 v_arrayElimCell_75))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 v_arrayElimCell_72)))))) .cse9))) (.cse17 (not .cse9))) (and (or (not .cse0) (and (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (let ((.cse2 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_801))) (store .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_796))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_803) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_804) .cse6) .cse7)))) (or (= (select .cse1 v_arrayElimCell_74) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_75 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 v_arrayElimCell_75)))))) (or (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse8 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_801))) (store .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_796))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_803) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_804) .cse6) .cse7)) v_arrayElimCell_75))) .cse9))) (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (store (let ((.cse11 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_801))) (store .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_796))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_803) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_804) .cse6) .cse7)))) (or (= (select .cse10 v_arrayElimCell_74) |c_ULTIMATE.start_main_~data~0#1|) (= (select .cse10 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 v_arrayElimCell_75))))) (or (= .cse6 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse12) (or .cse12 (= .cse13 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|)) (or .cse9 (and (or .cse0 (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_801))) (store .cse14 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse14 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_796))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_803) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_804) .cse6) .cse7)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|))) (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (store (let ((.cse16 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_801))) (store .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_796))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_803) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_804) .cse6) .cse7)))) (or (= (select .cse15 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_75 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 v_arrayElimCell_75)))))))) (or .cse17 (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse18 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_801))) (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_796))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_803) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_804) .cse6) .cse7)) v_arrayElimCell_74) |c_ULTIMATE.start_main_~data~0#1|))) (or .cse17 (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_801))) (store .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) .cse4 v_ArrVal_796))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_803) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_804) .cse6) .cse7)))) (or (= (select .cse19 v_arrayElimCell_74) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse19 v_arrayElimCell_75)))))))))) is different from false [2023-12-16 16:21:00,321 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse27 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse28 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_insert_~last~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select .cse27 .cse28)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse14 (= .cse6 .cse8)) (.cse15 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse8)) (.cse4 (bvadd |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| (_ bv8 32))) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse27 .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse9 (bvadd (_ bv4 32) .cse0))) (let ((.cse1 (and (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_arrayElimCell_75 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select (store (let ((.cse23 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_801))) (store .cse23 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse23 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_796))) .cse6 v_ArrVal_803) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) .cse6 v_ArrVal_804) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse22 v_arrayElimCell_74)) (= (select .cse22 v_arrayElimCell_72) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse22 v_arrayElimCell_75))))) (or .cse14 (and (or .cse15 (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse24 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_801))) (store .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_796))) .cse6 v_ArrVal_803) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) .cse6 v_ArrVal_804) .cse8) .cse9)) v_arrayElimCell_72) |c_ULTIMATE.start_main_~data~0#1|))) (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_801))) (store .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_796))) .cse6 v_ArrVal_803) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) .cse6 v_ArrVal_804) .cse8) .cse9)))) (or (= (select .cse25 v_arrayElimCell_72) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_75 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 v_arrayElimCell_75)))))))))) (.cse10 (not .cse14))) (and (or (= .cse0 |c_ULTIMATE.start_dll_insert_~last~0#1.offset|) .cse1) (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (store (let ((.cse3 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_801))) (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_796))) .cse6 v_ArrVal_803) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) .cse6 v_ArrVal_804) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 v_arrayElimCell_74)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 v_arrayElimCell_75)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))) (or .cse10 (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_801))) (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_796))) .cse6 v_ArrVal_803) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) .cse6 v_ArrVal_804) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 v_arrayElimCell_74)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 v_arrayElimCell_75)))))) (or (= |c_ULTIMATE.start_dll_insert_~last~0#1.base| .cse8) .cse1) (or .cse10 (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse13 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_801))) (store .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_796))) .cse6 v_ArrVal_803) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) .cse6 v_ArrVal_804) .cse8) .cse9)) v_arrayElimCell_74)))) (or .cse14 (and (or .cse15 (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse16 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_801))) (store .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_796))) .cse6 v_ArrVal_803) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) .cse6 v_ArrVal_804) .cse8) .cse9)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))) (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select (store (let ((.cse18 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_801))) (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_796))) .cse6 v_ArrVal_803) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) .cse6 v_ArrVal_804) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (forall ((v_arrayElimCell_75 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse17 v_arrayElimCell_75)))))))) (or (not .cse15) (and (or (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse19 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_801))) (store .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_796))) .cse6 v_ArrVal_803) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) .cse6 v_ArrVal_804) .cse8) .cse9)) v_arrayElimCell_75))) .cse14) (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select (store (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_801))) (store .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_796))) .cse6 v_ArrVal_803) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) .cse6 v_ArrVal_804) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 v_arrayElimCell_74)) (forall ((v_arrayElimCell_75 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 v_arrayElimCell_75))))))))))))) is different from false [2023-12-16 16:21:04,336 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse27 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse28 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_insert_~last~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select .cse27 .cse28)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse14 (= .cse6 .cse8)) (.cse15 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse8)) (.cse4 (bvadd |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| (_ bv8 32))) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse27 .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse9 (bvadd (_ bv4 32) .cse0))) (let ((.cse1 (and (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_arrayElimCell_75 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select (store (let ((.cse23 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_801))) (store .cse23 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse23 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_796))) .cse6 v_ArrVal_803) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) .cse6 v_ArrVal_804) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse22 v_arrayElimCell_74)) (= (select .cse22 v_arrayElimCell_72) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse22 v_arrayElimCell_75))))) (or .cse14 (and (or .cse15 (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse24 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_801))) (store .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_796))) .cse6 v_ArrVal_803) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) .cse6 v_ArrVal_804) .cse8) .cse9)) v_arrayElimCell_72) |c_ULTIMATE.start_main_~data~0#1|))) (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_arrayElimCell_72 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_801))) (store .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_796))) .cse6 v_ArrVal_803) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) .cse6 v_ArrVal_804) .cse8) .cse9)))) (or (= (select .cse25 v_arrayElimCell_72) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_75 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 v_arrayElimCell_75)))))))))) (.cse10 (not .cse14))) (and (or (= .cse0 |c_ULTIMATE.start_dll_insert_~last~0#1.offset|) .cse1) (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (store (let ((.cse3 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_801))) (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_796))) .cse6 v_ArrVal_803) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) .cse6 v_ArrVal_804) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 v_arrayElimCell_74)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 v_arrayElimCell_75)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))) (or .cse10 (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_801))) (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_796))) .cse6 v_ArrVal_803) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) .cse6 v_ArrVal_804) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 v_arrayElimCell_74)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 v_arrayElimCell_75)))))) (or (= |c_ULTIMATE.start_dll_insert_~last~0#1.base| .cse8) .cse1) (or .cse10 (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse13 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_801))) (store .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_796))) .cse6 v_ArrVal_803) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) .cse6 v_ArrVal_804) .cse8) .cse9)) v_arrayElimCell_74)))) (or .cse14 (and (or .cse15 (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse16 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_801))) (store .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_796))) .cse6 v_ArrVal_803) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) .cse6 v_ArrVal_804) .cse8) .cse9)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))) (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select (store (let ((.cse18 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_801))) (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_796))) .cse6 v_ArrVal_803) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) .cse6 v_ArrVal_804) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (forall ((v_arrayElimCell_75 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse17 v_arrayElimCell_75)))))))) (or (not .cse15) (and (or (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_arrayElimCell_75 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse19 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_801))) (store .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_796))) .cse6 v_ArrVal_803) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) .cse6 v_ArrVal_804) .cse8) .cse9)) v_arrayElimCell_75))) .cse14) (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ArrVal_796 (_ BitVec 32)) (v_ArrVal_803 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_804 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select (store (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_801))) (store .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_796))) .cse6 v_ArrVal_803) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_795) .cse6 v_ArrVal_804) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 v_arrayElimCell_74)) (forall ((v_arrayElimCell_75 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 v_arrayElimCell_75))))))))))))) is different from true [2023-12-16 16:21:05,383 INFO L349 Elim1Store]: treesize reduction 613, result has 44.8 percent of original size [2023-12-16 16:21:05,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 26275 treesize of output 25133 [2023-12-16 16:21:05,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:21:05,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3733 treesize of output 3799 [2023-12-16 16:21:05,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:21:05,818 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 3585 treesize of output 3578 [2023-12-16 16:21:05,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:21:05,952 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 3399 treesize of output 3392 [2023-12-16 16:21:05,997 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 3383 treesize of output 3377 [2023-12-16 16:21:06,045 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 3377 treesize of output 3369 [2023-12-16 16:21:10,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-16 16:21:25,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:21:25,599 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 1617 treesize of output 1614 Received shutdown request... [2023-12-16 16:21:30,726 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-16 16:21:30,726 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-16 16:21:30,747 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:21:30,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-16 16:21:30,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:30,948 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 26 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-7-6-2-1 context. [2023-12-16 16:21:30,952 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:21:30,953 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:21:30,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:21:30 BoogieIcfgContainer [2023-12-16 16:21:30,955 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:21:30,955 INFO L158 Benchmark]: Toolchain (without parser) took 72805.51ms. Allocated memory was 237.0MB in the beginning and 361.8MB in the end (delta: 124.8MB). Free memory was 170.6MB in the beginning and 263.8MB in the end (delta: -93.2MB). Peak memory consumption was 199.9MB. Max. memory is 8.0GB. [2023-12-16 16:21:30,955 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 237.0MB. Free memory is still 186.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:21:30,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.64ms. Allocated memory was 237.0MB in the beginning and 293.6MB in the end (delta: 56.6MB). Free memory was 170.4MB in the beginning and 254.8MB in the end (delta: -84.4MB). Peak memory consumption was 20.1MB. Max. memory is 8.0GB. [2023-12-16 16:21:30,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.23ms. Allocated memory is still 293.6MB. Free memory was 254.8MB in the beginning and 252.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:21:30,956 INFO L158 Benchmark]: Boogie Preprocessor took 53.02ms. Allocated memory is still 293.6MB. Free memory was 252.7MB in the beginning and 249.1MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 16:21:30,956 INFO L158 Benchmark]: RCFGBuilder took 600.12ms. Allocated memory is still 293.6MB. Free memory was 249.1MB in the beginning and 225.0MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-16 16:21:30,956 INFO L158 Benchmark]: TraceAbstraction took 71656.31ms. Allocated memory was 293.6MB in the beginning and 361.8MB in the end (delta: 68.2MB). Free memory was 224.4MB in the beginning and 263.8MB in the end (delta: -39.4MB). Peak memory consumption was 195.5MB. Max. memory is 8.0GB. [2023-12-16 16:21:30,957 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.22ms. Allocated memory is still 237.0MB. Free memory is still 186.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 453.64ms. Allocated memory was 237.0MB in the beginning and 293.6MB in the end (delta: 56.6MB). Free memory was 170.4MB in the beginning and 254.8MB in the end (delta: -84.4MB). Peak memory consumption was 20.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.23ms. Allocated memory is still 293.6MB. Free memory was 254.8MB in the beginning and 252.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.02ms. Allocated memory is still 293.6MB. Free memory was 252.7MB in the beginning and 249.1MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 600.12ms. Allocated memory is still 293.6MB. Free memory was 249.1MB in the beginning and 225.0MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 71656.31ms. Allocated memory was 293.6MB in the beginning and 361.8MB in the end (delta: 68.2MB). Free memory was 224.4MB in the beginning and 263.8MB in the end (delta: -39.4MB). Peak memory consumption was 195.5MB. 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 PolyPacSimplificationTermWalker was simplifying a ∨-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-7-6-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 71.6s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 158 SdHoareTripleChecker+Valid, 11.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 158 mSDsluCounter, 779 SdHoareTripleChecker+Invalid, 11.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 344 IncrementalHoareTripleChecker+Unchecked, 582 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1046 IncrementalHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 197 mSDtfsCounter, 1046 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 326 GetRequests, 221 SyntacticMatches, 7 SemanticMatches, 98 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 12.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=7, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 35 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 297 ConstructedInterpolants, 34 QuantifiedInterpolants, 3575 SizeOfPredicates, 76 NumberOfNonLiveVariables, 1788 ConjunctsInSsa, 132 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