/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/heap-manipulation/bubble_sort_linux-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 20:41:04,459 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 20:41:04,544 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 20:41:04,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 20:41:04,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 20:41:04,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 20:41:04,576 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 20:41:04,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 20:41:04,577 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 20:41:04,580 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 20:41:04,581 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 20:41:04,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 20:41:04,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 20:41:04,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 20:41:04,583 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 20:41:04,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 20:41:04,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 20:41:04,584 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 20:41:04,584 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 20:41:04,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 20:41:04,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 20:41:04,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 20:41:04,585 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 20:41:04,585 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 20:41:04,586 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 20:41:04,586 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 20:41:04,586 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 20:41:04,586 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 20:41:04,587 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 20:41:04,587 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 20:41:04,588 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 20:41:04,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 20:41:04,588 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 20:41:04,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 20:41:04,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 20:41:04,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 20:41:04,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 20:41:04,589 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 20:41:04,589 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 20:41:04,589 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 20:41:04,589 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 20:41:04,589 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 20:41:04,590 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 20:41:04,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 20:41:04,590 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 20:41:04,590 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 20:41:04,590 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 20:41:04,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 20:41:04,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 20:41:04,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 20:41:04,817 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 20:41:04,818 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 20:41:04,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-1.i [2023-12-24 20:41:05,933 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 20:41:06,185 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 20:41:06,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-1.i [2023-12-24 20:41:06,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed6dde324/f5741e61b99349e8a6251653b9c240fc/FLAG26964c718 [2023-12-24 20:41:06,211 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed6dde324/f5741e61b99349e8a6251653b9c240fc [2023-12-24 20:41:06,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 20:41:06,215 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 20:41:06,216 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 20:41:06,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 20:41:06,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 20:41:06,223 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 08:41:06" (1/1) ... [2023-12-24 20:41:06,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e496d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:41:06, skipping insertion in model container [2023-12-24 20:41:06,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 08:41:06" (1/1) ... [2023-12-24 20:41:06,270 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 20:41:06,598 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2023-12-24 20:41:06,656 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 20:41:06,671 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-24 20:41:06,689 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 20:41:06,727 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2023-12-24 20:41:06,746 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 20:41:06,753 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 20:41:06,789 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2023-12-24 20:41:06,802 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 20:41:06,862 INFO L206 MainTranslator]: Completed translation [2023-12-24 20:41:06,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:41:06 WrapperNode [2023-12-24 20:41:06,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 20:41:06,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 20:41:06,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 20:41:06,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 20:41:06,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:41:06" (1/1) ... [2023-12-24 20:41:06,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:41:06" (1/1) ... [2023-12-24 20:41:06,970 INFO L138 Inliner]: procedures = 235, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 115 [2023-12-24 20:41:06,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 20:41:06,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 20:41:06,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 20:41:06,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 20:41:06,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:41:06" (1/1) ... [2023-12-24 20:41:06,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:41:06" (1/1) ... [2023-12-24 20:41:07,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:41:06" (1/1) ... [2023-12-24 20:41:07,046 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2023-12-24 20:41:07,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:41:06" (1/1) ... [2023-12-24 20:41:07,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:41:06" (1/1) ... [2023-12-24 20:41:07,059 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:41:06" (1/1) ... [2023-12-24 20:41:07,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:41:06" (1/1) ... [2023-12-24 20:41:07,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:41:06" (1/1) ... [2023-12-24 20:41:07,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:41:06" (1/1) ... [2023-12-24 20:41:07,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 20:41:07,079 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 20:41:07,079 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 20:41:07,079 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 20:41:07,080 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:41:06" (1/1) ... [2023-12-24 20:41:07,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 20:41:07,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 20:41:07,104 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 20:41:07,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 20:41:07,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 20:41:07,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 20:41:07,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 20:41:07,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 20:41:07,130 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2023-12-24 20:41:07,131 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2023-12-24 20:41:07,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 20:41:07,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 20:41:07,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 20:41:07,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-24 20:41:07,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-24 20:41:07,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 20:41:07,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 20:41:07,131 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2023-12-24 20:41:07,132 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2023-12-24 20:41:07,132 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-12-24 20:41:07,132 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-12-24 20:41:07,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 20:41:07,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 20:41:07,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 20:41:07,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 20:41:07,135 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-12-24 20:41:07,135 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-12-24 20:41:07,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 20:41:07,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 20:41:07,306 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 20:41:07,307 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 20:41:07,746 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 20:41:07,784 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 20:41:07,784 INFO L309 CfgBuilder]: Removed 41 assume(true) statements. [2023-12-24 20:41:07,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 08:41:07 BoogieIcfgContainer [2023-12-24 20:41:07,784 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 20:41:07,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 20:41:07,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 20:41:07,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 20:41:07,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 08:41:06" (1/3) ... [2023-12-24 20:41:07,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46cf6b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 08:41:07, skipping insertion in model container [2023-12-24 20:41:07,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:41:06" (2/3) ... [2023-12-24 20:41:07,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46cf6b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 08:41:07, skipping insertion in model container [2023-12-24 20:41:07,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 08:41:07" (3/3) ... [2023-12-24 20:41:07,791 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2023-12-24 20:41:07,804 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 20:41:07,805 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 20:41:07,841 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 20:41:07,846 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;@62d347f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 20:41:07,847 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 20:41:07,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-24 20:41:07,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-24 20:41:07,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:41:07,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:41:07,856 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:41:07,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:41:07,860 INFO L85 PathProgramCache]: Analyzing trace with hash -754496073, now seen corresponding path program 1 times [2023-12-24 20:41:07,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:41:07,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490890609] [2023-12-24 20:41:07,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:41:07,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:41:07,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:41:07,876 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:41:07,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 20:41:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:41:07,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 20:41:07,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:41:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:41:07,998 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:41:07,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:41:07,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490890609] [2023-12-24 20:41:08,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490890609] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:41:08,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:41:08,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 20:41:08,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410310290] [2023-12-24 20:41:08,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:41:08,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 20:41:08,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:41:08,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 20:41:08,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 20:41:08,034 INFO L87 Difference]: Start difference. First operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:41:08,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:41:08,175 INFO L93 Difference]: Finished difference Result 210 states and 377 transitions. [2023-12-24 20:41:08,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 20:41:08,178 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 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) Word has length 8 [2023-12-24 20:41:08,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:41:08,184 INFO L225 Difference]: With dead ends: 210 [2023-12-24 20:41:08,185 INFO L226 Difference]: Without dead ends: 99 [2023-12-24 20:41:08,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 20:41:08,191 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 20:41:08,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 20:41:08,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-24 20:41:08,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-12-24 20:41:08,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 89 states have internal predecessors, (94), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-24 20:41:08,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2023-12-24 20:41:08,231 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 8 [2023-12-24 20:41:08,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:41:08,231 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2023-12-24 20:41:08,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:41:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2023-12-24 20:41:08,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-24 20:41:08,233 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:41:08,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:41:08,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 20:41:08,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:41:08,436 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:41:08,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:41:08,437 INFO L85 PathProgramCache]: Analyzing trace with hash 437181209, now seen corresponding path program 1 times [2023-12-24 20:41:08,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:41:08,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765193898] [2023-12-24 20:41:08,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:41:08,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:41:08,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:41:08,441 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:41:08,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 20:41:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:41:08,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 20:41:08,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:41:08,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:41:08,651 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:41:08,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:41:08,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765193898] [2023-12-24 20:41:08,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765193898] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:41:08,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:41:08,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 20:41:08,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244093383] [2023-12-24 20:41:08,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:41:08,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 20:41:08,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:41:08,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 20:41:08,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 20:41:08,655 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:41:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:41:08,980 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2023-12-24 20:41:08,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 20:41:08,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-12-24 20:41:08,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:41:08,987 INFO L225 Difference]: With dead ends: 101 [2023-12-24 20:41:08,987 INFO L226 Difference]: Without dead ends: 98 [2023-12-24 20:41:08,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 20:41:08,988 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 166 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 20:41:08,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 208 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 20:41:08,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-24 20:41:09,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-12-24 20:41:09,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 88 states have internal predecessors, (93), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-24 20:41:09,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2023-12-24 20:41:09,013 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 17 [2023-12-24 20:41:09,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:41:09,015 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2023-12-24 20:41:09,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:41:09,020 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2023-12-24 20:41:09,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-24 20:41:09,024 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:41:09,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:41:09,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 20:41:09,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:41:09,237 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:41:09,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:41:09,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1443607003, now seen corresponding path program 1 times [2023-12-24 20:41:09,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:41:09,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557634420] [2023-12-24 20:41:09,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:41:09,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:41:09,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:41:09,240 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:41:09,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 20:41:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:41:09,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 20:41:09,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:41:09,480 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 20:41:09,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-24 20:41:09,970 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-12-24 20:41:09,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 258 treesize of output 269 [2023-12-24 20:41:09,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 140 [2023-12-24 20:41:10,119 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 8 treesize of output 7 [2023-12-24 20:41:10,253 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 8 treesize of output 7 [2023-12-24 20:41:10,277 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 8 treesize of output 7 [2023-12-24 20:41:10,466 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:41:10,576 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-12-24 20:41:10,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 98 [2023-12-24 20:41:11,564 INFO L349 Elim1Store]: treesize reduction 146, result has 32.7 percent of original size [2023-12-24 20:41:11,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 533 treesize of output 488 [2023-12-24 20:41:13,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 20:41:13,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 20:41:13,985 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 14 treesize of output 11 [2023-12-24 20:41:14,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-12-24 20:41:14,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-12-24 20:41:14,286 INFO L349 Elim1Store]: treesize reduction 89, result has 14.4 percent of original size [2023-12-24 20:41:14,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 775 treesize of output 752 [2023-12-24 20:41:14,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 20:41:14,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 20:41:14,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-24 20:41:14,783 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:41:14,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2023-12-24 20:41:15,592 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 20:41:15,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-24 20:41:15,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-24 20:41:15,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:41:15,738 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:41:15,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:41:15,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557634420] [2023-12-24 20:41:15,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557634420] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:41:15,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:41:15,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-24 20:41:15,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611210249] [2023-12-24 20:41:15,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:41:15,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 20:41:15,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:41:15,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 20:41:15,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-24 20:41:15,740 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:41:16,177 WARN L876 $PredicateComparison]: unable to prove that (and (= (bvadd (select |c_#valid| (_ bv3 32)) (_ bv1 1)) (_ bv0 1)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_list_add_#in~head#1.base|))) (let ((.cse1 (= |c_list_add_#in~new#1.base| (select .cse0 |c_list_add_#in~head#1.offset|)))) (or (and (exists ((v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (store (store |c_#memory_$Pointer$#1.base| |c_list_add_#in~new#1.base| v_DerPreprocessor_28) |c_list_add_#in~head#1.base| .cse0) |c_list_add_#in~new#1.base|) v_DerPreprocessor_28)) .cse1 (exists ((v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (Array (_ BitVec 32) (_ BitVec 32)))) (= v_DerPreprocessor_20 (select (store (store |c_#memory_$Pointer$#1.base| |c_list_add_#in~new#1.base| v_DerPreprocessor_20) |c_list_add_#in~head#1.base| v_DerPreprocessor_21) |c_list_add_#in~new#1.base|)))) (and (exists ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_35 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse2 (store (store (store |c_#memory_$Pointer$#1.base| v_arrayElimCell_4 v_DerPreprocessor_35) |c_list_add_#in~new#1.base| v_DerPreprocessor_36) |c_list_add_#in~head#1.base| .cse0))) (and (= (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_4) (select .cse2 v_arrayElimCell_4)) (not (= v_arrayElimCell_4 |c_list_add_#in~head#1.base|)) (= (select .cse2 |c_list_add_#in~new#1.base|) v_DerPreprocessor_36)))) (exists ((v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (store (store |c_#memory_$Pointer$#1.base| |c_list_add_#in~new#1.base| v_DerPreprocessor_22) |c_list_add_#in~head#1.base| v_DerPreprocessor_23) |c_list_add_#in~new#1.base|) v_DerPreprocessor_22)) .cse1) (and (not (= |c_list_add_#in~new#1.base| |c_list_add_#in~head#1.base|)) .cse1) (and (exists ((v_DerPreprocessor_33 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (store (store |c_#memory_$Pointer$#1.base| |c_list_add_#in~new#1.base| v_DerPreprocessor_33) |c_list_add_#in~head#1.base| .cse0) |c_list_add_#in~new#1.base|) v_DerPreprocessor_33)) .cse1 (exists ((v_prenex_15 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_19 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |c_list_add_#in~new#1.base| (select v_DerPreprocessor_19 |c_list_add_#in~head#1.offset|)) (= v_prenex_15 (select (store (store |c_#memory_$Pointer$#1.base| |c_list_add_#in~new#1.base| v_prenex_15) |c_list_add_#in~head#1.base| v_DerPreprocessor_19) |c_list_add_#in~new#1.base|))))) (and (exists ((v_DerPreprocessor_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_4 (_ BitVec 32)) (v_DerPreprocessor_42 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$#1.base| v_arrayElimCell_4 v_DerPreprocessor_41) |c_list_add_#in~new#1.base| v_DerPreprocessor_42) |c_list_add_#in~head#1.base| .cse0))) (let ((.cse3 (select .cse4 v_arrayElimCell_4))) (and (= (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_4) .cse3) (= |c_list_add_#in~new#1.base| (select v_DerPreprocessor_13 |c_list_add_#in~head#1.offset|)) (= |c_list_add_#in~new#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_list_add_#in~head#1.base| v_DerPreprocessor_13) v_arrayElimCell_4) |c_list_add_#in~head#1.offset|)) (= v_DerPreprocessor_41 .cse3) (= (select .cse4 |c_list_add_#in~new#1.base|) v_DerPreprocessor_42) (= (select (store (store |c_#memory_$Pointer$#1.base| |c_list_add_#in~new#1.base| v_prenex_11) |c_list_add_#in~head#1.base| v_DerPreprocessor_13) |c_list_add_#in~new#1.base|) v_prenex_11))))) .cse1) (and (exists ((v_DerPreprocessor_24 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (store (store |c_#memory_$Pointer$#1.base| |c_list_add_#in~new#1.base| v_DerPreprocessor_24) |c_list_add_#in~head#1.base| .cse0) |c_list_add_#in~new#1.base|) v_DerPreprocessor_24)) (exists ((v_DerPreprocessor_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (= v_DerPreprocessor_14 (select (store (store |c_#memory_$Pointer$#1.base| |c_list_add_#in~new#1.base| v_DerPreprocessor_14) |c_list_add_#in~head#1.base| v_DerPreprocessor_15) |c_list_add_#in~new#1.base|))) .cse1) (and (exists ((v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_4 (_ BitVec 32)) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store (store |c_#memory_$Pointer$#1.base| v_arrayElimCell_4 v_DerPreprocessor_30) |c_list_add_#in~new#1.base| v_DerPreprocessor_31) |c_list_add_#in~head#1.base| .cse0))) (let ((.cse5 (select .cse6 v_arrayElimCell_4)) (.cse7 (store (store |c_#memory_$Pointer$#1.base| |c_list_add_#in~new#1.base| v_DerPreprocessor_9) |c_list_add_#in~head#1.base| v_DerPreprocessor_10))) (and (= .cse5 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_4)) (= v_DerPreprocessor_31 (select .cse6 |c_list_add_#in~new#1.base|)) (= (select .cse7 |c_list_add_#in~new#1.base|) v_DerPreprocessor_9) (= .cse5 v_DerPreprocessor_30) (= (select .cse7 v_arrayElimCell_4) (select |c_#memory_$Pointer$#1.base| |c_list_add_#in~new#1.base|)))))) .cse1) (and (exists ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse9 (store (store |c_#memory_$Pointer$#1.base| |c_list_add_#in~new#1.base| v_DerPreprocessor_11) |c_list_add_#in~head#1.base| v_DerPreprocessor_12)) (.cse8 (store (store (store |c_#memory_$Pointer$#1.base| v_arrayElimCell_4 v_DerPreprocessor_38) |c_list_add_#in~new#1.base| v_DerPreprocessor_39) |c_list_add_#in~head#1.base| .cse0))) (and (= v_DerPreprocessor_39 (select .cse8 |c_list_add_#in~new#1.base|)) (not (= |c_list_add_#in~new#1.base| v_arrayElimCell_4)) (= (select .cse9 |c_list_add_#in~new#1.base|) v_DerPreprocessor_11) (= (select (select .cse9 v_arrayElimCell_4) |c_list_add_#in~head#1.offset|) |c_list_add_#in~new#1.base|) (= (select .cse8 v_arrayElimCell_4) (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_4))))) .cse1) (and (exists ((v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (store (store |c_#memory_$Pointer$#1.base| |c_list_add_#in~new#1.base| v_DerPreprocessor_26) |c_list_add_#in~head#1.base| .cse0) |c_list_add_#in~new#1.base|) v_DerPreprocessor_26)) (exists ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |c_list_add_#in~new#1.base| (select v_DerPreprocessor_18 |c_list_add_#in~head#1.offset|)) (= (select (store (store |c_#memory_$Pointer$#1.base| |c_list_add_#in~new#1.base| v_prenex_13) |c_list_add_#in~head#1.base| v_DerPreprocessor_18) |c_list_add_#in~new#1.base|) v_prenex_13))) .cse1)))) (= (_ bv3 32) |c_~#gl_list~0.base|)) is different from true [2023-12-24 20:41:17,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:41:17,288 INFO L93 Difference]: Finished difference Result 198 states and 236 transitions. [2023-12-24 20:41:17,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 20:41:17,289 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-12-24 20:41:17,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:41:17,291 INFO L225 Difference]: With dead ends: 198 [2023-12-24 20:41:17,291 INFO L226 Difference]: Without dead ends: 195 [2023-12-24 20:41:17,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=159, Unknown=1, NotChecked=26, Total=240 [2023-12-24 20:41:17,293 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 279 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-24 20:41:17,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 577 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 486 Invalid, 0 Unknown, 9 Unchecked, 1.3s Time] [2023-12-24 20:41:17,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-12-24 20:41:17,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 177. [2023-12-24 20:41:17,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 145 states have (on average 1.2551724137931035) internal successors, (182), 160 states have internal predecessors, (182), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-24 20:41:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 216 transitions. [2023-12-24 20:41:17,319 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 216 transitions. Word has length 20 [2023-12-24 20:41:17,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:41:17,319 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 216 transitions. [2023-12-24 20:41:17,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:41:17,319 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 216 transitions. [2023-12-24 20:41:17,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-24 20:41:17,320 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:41:17,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:41:17,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 20:41:17,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:41:17,526 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:41:17,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:41:17,527 INFO L85 PathProgramCache]: Analyzing trace with hash 722118342, now seen corresponding path program 1 times [2023-12-24 20:41:17,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:41:17,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190531539] [2023-12-24 20:41:17,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:41:17,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:41:17,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:41:17,529 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:41:17,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 20:41:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:41:17,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-24 20:41:17,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:41:17,748 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 20:41:17,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-24 20:41:17,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:41:17,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:41:17,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 41 treesize of output 46 [2023-12-24 20:41:17,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2023-12-24 20:41:18,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:41:18,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2023-12-24 20:41:18,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2023-12-24 20:41:18,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-24 20:41:18,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:41:18,232 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:41:18,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:41:18,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190531539] [2023-12-24 20:41:18,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190531539] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:41:18,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:41:18,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-24 20:41:18,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243742127] [2023-12-24 20:41:18,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:41:18,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 20:41:18,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:41:18,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 20:41:18,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=87, Unknown=3, NotChecked=0, Total=110 [2023-12-24 20:41:18,235 INFO L87 Difference]: Start difference. First operand 177 states and 216 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:41:23,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:41:28,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:41:32,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:41:37,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:41:37,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:41:37,575 INFO L93 Difference]: Finished difference Result 197 states and 234 transitions. [2023-12-24 20:41:37,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 20:41:37,578 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2023-12-24 20:41:37,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:41:37,579 INFO L225 Difference]: With dead ends: 197 [2023-12-24 20:41:37,580 INFO L226 Difference]: Without dead ends: 194 [2023-12-24 20:41:37,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=208, Unknown=8, NotChecked=0, Total=272 [2023-12-24 20:41:37,581 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 218 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 33 mSolverCounterUnsat, 114 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 114 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2023-12-24 20:41:37,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 320 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 878 Invalid, 114 Unknown, 0 Unchecked, 18.8s Time] [2023-12-24 20:41:37,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-12-24 20:41:37,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 177. [2023-12-24 20:41:37,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 145 states have (on average 1.2482758620689656) internal successors, (181), 160 states have internal predecessors, (181), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-24 20:41:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 215 transitions. [2023-12-24 20:41:37,611 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 215 transitions. Word has length 23 [2023-12-24 20:41:37,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:41:37,611 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 215 transitions. [2023-12-24 20:41:37,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:41:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 215 transitions. [2023-12-24 20:41:37,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-24 20:41:37,612 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:41:37,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:41:37,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 20:41:37,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:41:37,818 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:41:37,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:41:37,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1115915285, now seen corresponding path program 1 times [2023-12-24 20:41:37,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:41:37,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880455298] [2023-12-24 20:41:37,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:41:37,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:41:37,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:41:37,820 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:41:37,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 20:41:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:41:37,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-24 20:41:37,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:41:38,169 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 20:41:38,170 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 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-24 20:41:38,356 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 16 treesize of output 11 [2023-12-24 20:41:38,399 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 16 treesize of output 11 [2023-12-24 20:41:38,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-12-24 20:41:38,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2023-12-24 20:41:38,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:41:38,969 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 25 treesize of output 14 [2023-12-24 20:41:38,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2023-12-24 20:41:39,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-24 20:41:39,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:41:39,988 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:41:39,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:41:39,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880455298] [2023-12-24 20:41:39,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880455298] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:41:39,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:41:39,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-24 20:41:39,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140207159] [2023-12-24 20:41:39,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:41:39,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 20:41:39,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:41:39,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 20:41:39,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=89, Unknown=1, NotChecked=0, Total=110 [2023-12-24 20:41:39,990 INFO L87 Difference]: Start difference. First operand 177 states and 215 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:41:47,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:41:47,587 INFO L93 Difference]: Finished difference Result 196 states and 232 transitions. [2023-12-24 20:41:47,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 20:41:47,588 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-12-24 20:41:47,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:41:47,589 INFO L225 Difference]: With dead ends: 196 [2023-12-24 20:41:47,589 INFO L226 Difference]: Without dead ends: 193 [2023-12-24 20:41:47,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=54, Invalid=212, Unknown=6, NotChecked=0, Total=272 [2023-12-24 20:41:47,590 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 257 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 31 mSolverCounterUnsat, 79 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 79 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2023-12-24 20:41:47,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 360 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 841 Invalid, 79 Unknown, 0 Unchecked, 6.8s Time] [2023-12-24 20:41:47,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-12-24 20:41:47,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 177. [2023-12-24 20:41:47,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 145 states have (on average 1.2413793103448276) internal successors, (180), 160 states have internal predecessors, (180), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-24 20:41:47,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 214 transitions. [2023-12-24 20:41:47,615 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 214 transitions. Word has length 26 [2023-12-24 20:41:47,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:41:47,615 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 214 transitions. [2023-12-24 20:41:47,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:41:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 214 transitions. [2023-12-24 20:41:47,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-24 20:41:47,617 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:41:47,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:41:47,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 20:41:47,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:41:47,822 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:41:47,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:41:47,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1422251983, now seen corresponding path program 1 times [2023-12-24 20:41:47,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:41:47,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204712670] [2023-12-24 20:41:47,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:41:47,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:41:47,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:41:47,824 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:41:47,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-24 20:41:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:41:47,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-24 20:41:47,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:41:48,140 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 20:41:48,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-24 20:41:48,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:41:48,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:41:49,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 41 treesize of output 46 [2023-12-24 20:41:49,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2023-12-24 20:41:49,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73 [2023-12-24 20:41:49,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 69 [2023-12-24 20:41:49,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2023-12-24 20:41:49,496 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 22 treesize of output 34 [2023-12-24 20:41:49,948 INFO L349 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2023-12-24 20:41:49,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 126 treesize of output 102 [2023-12-24 20:41:49,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:41:49,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2023-12-24 20:41:49,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-12-24 20:41:50,008 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 21 treesize of output 37 [2023-12-24 20:41:50,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2023-12-24 20:41:51,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2023-12-24 20:41:51,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:41:51,918 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:41:51,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:41:51,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204712670] [2023-12-24 20:41:51,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204712670] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:41:51,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:41:51,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-24 20:41:51,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885949903] [2023-12-24 20:41:51,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:41:51,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 20:41:51,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:41:51,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 20:41:51,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-12-24 20:41:51,920 INFO L87 Difference]: Start difference. First operand 177 states and 214 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:41:57,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:42:05,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:42:05,840 INFO L93 Difference]: Finished difference Result 195 states and 230 transitions. [2023-12-24 20:42:05,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 20:42:05,841 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2023-12-24 20:42:05,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:42:05,842 INFO L225 Difference]: With dead ends: 195 [2023-12-24 20:42:05,842 INFO L226 Difference]: Without dead ends: 192 [2023-12-24 20:42:05,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2023-12-24 20:42:05,843 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 250 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 28 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2023-12-24 20:42:05,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 393 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 937 Invalid, 7 Unknown, 0 Unchecked, 12.8s Time] [2023-12-24 20:42:05,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-12-24 20:42:05,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 177. [2023-12-24 20:42:05,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 145 states have (on average 1.2344827586206897) internal successors, (179), 160 states have internal predecessors, (179), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-24 20:42:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 213 transitions. [2023-12-24 20:42:05,876 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 213 transitions. Word has length 29 [2023-12-24 20:42:05,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:42:05,877 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 213 transitions. [2023-12-24 20:42:05,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:42:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 213 transitions. [2023-12-24 20:42:05,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-24 20:42:05,878 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:42:05,878 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:42:05,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-24 20:42:06,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:42:06,083 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:42:06,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:42:06,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1313683681, now seen corresponding path program 1 times [2023-12-24 20:42:06,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:42:06,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977405896] [2023-12-24 20:42:06,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:42:06,084 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:42:06,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:42:06,086 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:42:06,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 20:42:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:42:06,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 20:42:06,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:42:06,472 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 31 treesize of output 19 [2023-12-24 20:42:06,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2023-12-24 20:42:06,494 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 8 treesize of output 7 [2023-12-24 20:42:06,511 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 7 treesize of output 3 [2023-12-24 20:42:06,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-24 20:42:06,532 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 46 treesize of output 26 [2023-12-24 20:42:06,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:42:06,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-24 20:42:06,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 20:42:06,569 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 51 treesize of output 39 [2023-12-24 20:42:06,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 35 treesize of output 41 [2023-12-24 20:42:06,591 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-24 20:42:06,601 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 73 treesize of output 49 [2023-12-24 20:42:06,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 40 treesize of output 51 [2023-12-24 20:42:06,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:42:06,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 25 [2023-12-24 20:42:06,683 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 25 treesize of output 1 [2023-12-24 20:42:06,817 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 22 treesize of output 25 [2023-12-24 20:42:07,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-24 20:42:07,473 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:42:07,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:42:07,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977405896] [2023-12-24 20:42:07,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977405896] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:42:07,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:42:07,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-24 20:42:07,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609684556] [2023-12-24 20:42:07,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:42:07,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 20:42:07,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:42:07,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 20:42:07,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-24 20:42:07,475 INFO L87 Difference]: Start difference. First operand 177 states and 213 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 20:42:10,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:42:10,241 INFO L93 Difference]: Finished difference Result 261 states and 313 transitions. [2023-12-24 20:42:10,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 20:42:10,242 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2023-12-24 20:42:10,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:42:10,244 INFO L225 Difference]: With dead ends: 261 [2023-12-24 20:42:10,244 INFO L226 Difference]: Without dead ends: 255 [2023-12-24 20:42:10,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-12-24 20:42:10,245 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 344 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-24 20:42:10,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 452 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-24 20:42:10,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-12-24 20:42:10,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 240. [2023-12-24 20:42:10,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.2450980392156863) internal successors, (254), 219 states have internal predecessors, (254), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 20:42:10,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 293 transitions. [2023-12-24 20:42:10,283 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 293 transitions. Word has length 30 [2023-12-24 20:42:10,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:42:10,283 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 293 transitions. [2023-12-24 20:42:10,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 20:42:10,284 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 293 transitions. [2023-12-24 20:42:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-24 20:42:10,284 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:42:10,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:42:10,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 20:42:10,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:42:10,491 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:42:10,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:42:10,492 INFO L85 PathProgramCache]: Analyzing trace with hash -678942440, now seen corresponding path program 1 times [2023-12-24 20:42:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:42:10,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309687397] [2023-12-24 20:42:10,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:42:10,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:42:10,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:42:10,494 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:42:10,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-24 20:42:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:42:10,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-24 20:42:10,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:42:10,855 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 20:42:10,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-24 20:42:11,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:42:11,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:42:12,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73 [2023-12-24 20:42:12,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 69 [2023-12-24 20:42:12,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-12-24 20:42:12,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 24 [2023-12-24 20:42:12,377 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 21 treesize of output 11 [2023-12-24 20:42:12,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 41 treesize of output 46 [2023-12-24 20:42:12,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2023-12-24 20:42:12,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:42:12,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2023-12-24 20:42:12,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2023-12-24 20:42:12,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 36 [2023-12-24 20:42:14,243 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 49 treesize of output 29 [2023-12-24 20:42:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:42:14,808 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:42:14,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:42:14,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309687397] [2023-12-24 20:42:14,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309687397] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:42:14,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:42:14,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-24 20:42:14,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927851120] [2023-12-24 20:42:14,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:42:14,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 20:42:14,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:42:14,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 20:42:14,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-12-24 20:42:14,810 INFO L87 Difference]: Start difference. First operand 240 states and 293 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:42:26,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:42:26,265 INFO L93 Difference]: Finished difference Result 257 states and 308 transitions. [2023-12-24 20:42:26,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 20:42:26,267 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2023-12-24 20:42:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:42:26,268 INFO L225 Difference]: With dead ends: 257 [2023-12-24 20:42:26,269 INFO L226 Difference]: Without dead ends: 254 [2023-12-24 20:42:26,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2023-12-24 20:42:26,270 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 244 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 27 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2023-12-24 20:42:26,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 405 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 926 Invalid, 6 Unknown, 0 Unchecked, 9.9s Time] [2023-12-24 20:42:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-12-24 20:42:26,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 240. [2023-12-24 20:42:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.2401960784313726) internal successors, (253), 219 states have internal predecessors, (253), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 20:42:26,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 292 transitions. [2023-12-24 20:42:26,309 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 292 transitions. Word has length 32 [2023-12-24 20:42:26,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:42:26,309 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 292 transitions. [2023-12-24 20:42:26,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:42:26,309 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 292 transitions. [2023-12-24 20:42:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-24 20:42:26,310 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:42:26,310 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:42:26,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-24 20:42:26,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:42:26,515 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:42:26,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:42:26,516 INFO L85 PathProgramCache]: Analyzing trace with hash -58033664, now seen corresponding path program 1 times [2023-12-24 20:42:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:42:26,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144961372] [2023-12-24 20:42:26,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:42:26,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:42:26,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:42:26,518 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:42:26,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-24 20:42:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:42:26,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-24 20:42:26,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:42:27,078 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 20:42:27,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 20:42:27,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:42:27,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:42:28,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:42:28,119 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 22 treesize of output 14 [2023-12-24 20:42:28,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-24 20:42:28,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 41 treesize of output 46 [2023-12-24 20:42:28,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:42:28,188 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 36 treesize of output 19 [2023-12-24 20:42:28,200 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 21 treesize of output 11 [2023-12-24 20:42:28,433 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 20:42:28,433 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-24 20:42:28,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-24 20:42:28,952 INFO L349 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2023-12-24 20:42:28,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2023-12-24 20:42:29,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:42:29,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-12-24 20:42:29,638 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 55 [2023-12-24 20:42:29,650 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 17 treesize of output 9 [2023-12-24 20:42:29,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:42:29,663 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 26 treesize of output 23 [2023-12-24 20:42:29,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-12-24 20:42:29,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:42:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:42:30,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:42:31,946 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_582 (_ BitVec 32)) (v_ArrVal_581 (_ BitVec 32))) (not (= |c_~#gl_list~0.offset| (select (select (store (let ((.cse0 (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (store |c_#memory_$Pointer$#1.offset| .cse1 (store (select |c_#memory_$Pointer$#1.offset| .cse1) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) v_ArrVal_582))))) (store .cse0 |c_~#gl_list~0.base| (store (select (store .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_580) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_581))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_571) |c_~#gl_list~0.base|) (bvadd (_ bv4 32) |c_~#gl_list~0.offset|))))) is different from false [2023-12-24 20:42:31,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:42:31,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144961372] [2023-12-24 20:42:31,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144961372] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:42:31,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1594686169] [2023-12-24 20:42:31,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:42:31,953 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 20:42:31,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 20:42:31,997 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 20:42:31,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-12-24 20:42:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:42:32,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-24 20:42:32,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:42:32,815 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 20:42:32,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 20:42:33,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:42:33,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:42:33,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 37 treesize of output 42 [2023-12-24 20:42:33,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:42:33,927 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 32 treesize of output 15 [2023-12-24 20:42:33,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 18 [2023-12-24 20:42:34,379 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 20:42:34,380 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 47 treesize of output 42 [2023-12-24 20:42:35,028 INFO L349 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2023-12-24 20:42:35,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2023-12-24 20:42:35,469 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 36 treesize of output 25 [2023-12-24 20:42:36,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:42:37,889 INFO L349 Elim1Store]: treesize reduction 180, result has 10.4 percent of original size [2023-12-24 20:42:37,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 222 treesize of output 331 [2023-12-24 20:42:38,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2023-12-24 20:42:38,218 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:42:38,361 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:42:38,361 INFO L224 Elim1Store]: Index analysis took 272 ms [2023-12-24 20:42:38,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 134 [2023-12-24 20:42:38,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 408 treesize of output 293 [2023-12-24 20:42:38,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:42:39,021 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2023-12-24 20:42:39,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 670 treesize of output 513 [2023-12-24 20:42:39,039 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 21 treesize of output 15 [2023-12-24 20:42:39,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-24 20:42:40,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:42:40,221 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:42:41,277 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_697 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_~#gl_list~0.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_697) |c_~#gl_list~0.base|) (bvadd (_ bv4 32) |c_~#gl_list~0.offset|))))) is different from false [2023-12-24 20:42:41,832 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_705 (_ BitVec 32)) (v_ArrVal_697 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_706 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_706))) (store .cse0 |c_~#gl_list~0.base| (store (select (store .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_gl_insert_~node~1#1.offset|) .cse1) (bvadd (_ bv8 32) |c_ULTIMATE.start_gl_insert_~node~1#1.offset|) |c_~#gl_list~0.base|)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_705)))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_697) |c_~#gl_list~0.base|) (bvadd (_ bv4 32) |c_~#gl_list~0.offset|)) |c_~#gl_list~0.base|))) is different from false [2023-12-24 20:42:41,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1594686169] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:42:41,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:42:41,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2023-12-24 20:42:41,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021521449] [2023-12-24 20:42:41,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:42:41,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-24 20:42:41,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:42:41,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-24 20:42:41,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1184, Unknown=45, NotChecked=216, Total=1560 [2023-12-24 20:42:41,843 INFO L87 Difference]: Start difference. First operand 240 states and 292 transitions. Second operand has 28 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 18 states have internal predecessors, (52), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-24 20:43:16,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:43:16,644 INFO L93 Difference]: Finished difference Result 350 states and 418 transitions. [2023-12-24 20:43:16,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-24 20:43:16,644 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 18 states have internal predecessors, (52), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2023-12-24 20:43:16,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:43:16,646 INFO L225 Difference]: With dead ends: 350 [2023-12-24 20:43:16,646 INFO L226 Difference]: Without dead ends: 347 [2023-12-24 20:43:16,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=350, Invalid=2334, Unknown=84, NotChecked=312, Total=3080 [2023-12-24 20:43:16,648 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 971 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 2128 mSolverCounterSat, 174 mSolverCounterUnsat, 433 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 2735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 2128 IncrementalHoareTripleChecker+Invalid, 433 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2023-12-24 20:43:16,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 618 Invalid, 2735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 2128 Invalid, 433 Unknown, 0 Unchecked, 20.6s Time] [2023-12-24 20:43:16,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2023-12-24 20:43:16,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 319. [2023-12-24 20:43:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 275 states have (on average 1.24) internal successors, (341), 291 states have internal predecessors, (341), 33 states have call successors, (33), 12 states have call predecessors, (33), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 20:43:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 389 transitions. [2023-12-24 20:43:16,698 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 389 transitions. Word has length 33 [2023-12-24 20:43:16,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:43:16,699 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 389 transitions. [2023-12-24 20:43:16,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 18 states have internal predecessors, (52), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-24 20:43:16,699 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 389 transitions. [2023-12-24 20:43:16,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-24 20:43:16,700 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:43:16,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:43:16,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2023-12-24 20:43:16,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-24 20:43:17,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:43:17,109 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:43:17,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:43:17,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1581408063, now seen corresponding path program 1 times [2023-12-24 20:43:17,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:43:17,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270511081] [2023-12-24 20:43:17,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:43:17,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:43:17,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:43:17,110 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:43:17,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-24 20:43:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:43:17,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-24 20:43:17,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:43:17,406 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 20:43:17,407 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 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-24 20:43:17,562 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 16 treesize of output 11 [2023-12-24 20:43:17,609 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 16 treesize of output 11 [2023-12-24 20:43:17,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-12-24 20:43:17,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2023-12-24 20:43:18,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:43:18,128 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 25 treesize of output 14 [2023-12-24 20:43:18,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2023-12-24 20:43:18,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-24 20:43:19,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:43:19,281 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:43:19,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:43:19,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270511081] [2023-12-24 20:43:19,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270511081] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:43:19,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:43:19,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-24 20:43:19,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958044392] [2023-12-24 20:43:19,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:43:19,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 20:43:19,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:43:19,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 20:43:19,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=109, Unknown=1, NotChecked=0, Total=132 [2023-12-24 20:43:19,283 INFO L87 Difference]: Start difference. First operand 319 states and 389 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:43:27,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:43:27,012 INFO L93 Difference]: Finished difference Result 332 states and 400 transitions. [2023-12-24 20:43:27,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 20:43:27,013 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2023-12-24 20:43:27,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:43:27,014 INFO L225 Difference]: With dead ends: 332 [2023-12-24 20:43:27,015 INFO L226 Difference]: Without dead ends: 329 [2023-12-24 20:43:27,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=75, Invalid=297, Unknown=8, NotChecked=0, Total=380 [2023-12-24 20:43:27,015 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 281 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 26 mSolverCounterUnsat, 73 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 73 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-12-24 20:43:27,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 453 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 877 Invalid, 73 Unknown, 0 Unchecked, 6.7s Time] [2023-12-24 20:43:27,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2023-12-24 20:43:27,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 319. [2023-12-24 20:43:27,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 275 states have (on average 1.2363636363636363) internal successors, (340), 291 states have internal predecessors, (340), 33 states have call successors, (33), 12 states have call predecessors, (33), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 20:43:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 388 transitions. [2023-12-24 20:43:27,064 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 388 transitions. Word has length 35 [2023-12-24 20:43:27,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:43:27,065 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 388 transitions. [2023-12-24 20:43:27,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:43:27,065 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 388 transitions. [2023-12-24 20:43:27,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-24 20:43:27,066 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:43:27,066 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:43:27,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-24 20:43:27,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:43:27,272 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:43:27,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:43:27,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1738679921, now seen corresponding path program 1 times [2023-12-24 20:43:27,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:43:27,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230090409] [2023-12-24 20:43:27,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:43:27,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:43:27,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:43:27,274 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:43:27,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-24 20:43:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:43:27,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-24 20:43:27,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:43:27,710 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 20:43:27,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 20:43:27,910 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 16 treesize of output 11 [2023-12-24 20:43:27,952 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 16 treesize of output 11 [2023-12-24 20:43:28,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-12-24 20:43:28,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2023-12-24 20:43:28,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:43:28,759 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 23 treesize of output 14 [2023-12-24 20:43:28,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2023-12-24 20:43:29,439 INFO L349 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2023-12-24 20:43:29,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2023-12-24 20:43:29,742 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 44 treesize of output 31 [2023-12-24 20:43:30,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:43:30,227 INFO L349 Elim1Store]: treesize reduction 74, result has 12.9 percent of original size [2023-12-24 20:43:30,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 117 [2023-12-24 20:43:30,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 89 [2023-12-24 20:43:30,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 31 [2023-12-24 20:43:30,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2023-12-24 20:43:31,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-24 20:43:31,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:43:31,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:43:31,978 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_876 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_876) |c_~#gl_list~0.base|) (bvadd (_ bv4 32) |c_~#gl_list~0.offset|)) (_ bv0 32)))) is different from false [2023-12-24 20:43:32,287 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_886 (_ BitVec 32)) (v_ArrVal_876 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) v_ArrVal_884))) (store .cse0 |c_~#gl_list~0.base| (store (select (store .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_885) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_886))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_876) |c_~#gl_list~0.base|) (bvadd (_ bv4 32) |c_~#gl_list~0.offset|)) (_ bv0 32)))) is different from false [2023-12-24 20:43:32,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:43:32,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230090409] [2023-12-24 20:43:32,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230090409] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:43:32,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [531734052] [2023-12-24 20:43:32,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:43:32,293 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 20:43:32,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 20:43:32,297 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 20:43:32,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-12-24 20:43:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:43:33,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-24 20:43:33,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:43:33,411 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 20:43:33,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 20:43:33,551 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 16 treesize of output 11 [2023-12-24 20:43:33,606 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 16 treesize of output 11 [2023-12-24 20:43:33,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-12-24 20:43:33,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2023-12-24 20:43:34,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:43:34,110 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 23 treesize of output 14 [2023-12-24 20:43:34,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2023-12-24 20:43:34,709 INFO L349 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2023-12-24 20:43:34,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2023-12-24 20:43:35,026 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 44 treesize of output 31 [2023-12-24 20:43:35,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:43:36,537 INFO L349 Elim1Store]: treesize reduction 180, result has 10.4 percent of original size [2023-12-24 20:43:36,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 230 treesize of output 337 [2023-12-24 20:43:36,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 361 treesize of output 288 [2023-12-24 20:43:36,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 26 [2023-12-24 20:43:37,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:43:37,252 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2023-12-24 20:43:37,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 392 treesize of output 249 [2023-12-24 20:43:37,279 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 15 treesize of output 11 [2023-12-24 20:43:37,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-24 20:43:37,714 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:43:37,714 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:43:38,700 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1009 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1010 (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1009))) (store .cse0 |c_~#gl_list~0.base| (store (select (store .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_gl_insert_~node~1#1.offset|) .cse1) (bvadd (_ bv8 32) |c_ULTIMATE.start_gl_insert_~node~1#1.offset|) |c_~#gl_list~0.base|)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_1010)))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1001) |c_~#gl_list~0.base|) (bvadd (_ bv4 32) |c_~#gl_list~0.offset|))))) is different from false [2023-12-24 20:43:38,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [531734052] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:43:38,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:43:38,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 18 [2023-12-24 20:43:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160348413] [2023-12-24 20:43:38,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:43:38,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-24 20:43:38,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:43:38,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-24 20:43:38,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=444, Unknown=38, NotChecked=138, Total=702 [2023-12-24 20:43:38,710 INFO L87 Difference]: Start difference. First operand 319 states and 388 transitions. Second operand has 19 states, 16 states have (on average 2.1875) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 20:43:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:43:53,373 INFO L93 Difference]: Finished difference Result 348 states and 414 transitions. [2023-12-24 20:43:53,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-24 20:43:53,374 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.1875) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2023-12-24 20:43:53,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:43:53,376 INFO L225 Difference]: With dead ends: 348 [2023-12-24 20:43:53,376 INFO L226 Difference]: Without dead ends: 345 [2023-12-24 20:43:53,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 81 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=190, Invalid=954, Unknown=58, NotChecked=204, Total=1406 [2023-12-24 20:43:53,377 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 635 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 83 mSolverCounterUnsat, 314 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 314 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2023-12-24 20:43:53,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 412 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1446 Invalid, 314 Unknown, 0 Unchecked, 11.5s Time] [2023-12-24 20:43:53,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2023-12-24 20:43:53,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 319. [2023-12-24 20:43:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 275 states have (on average 1.2327272727272727) internal successors, (339), 291 states have internal predecessors, (339), 33 states have call successors, (33), 12 states have call predecessors, (33), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 20:43:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 387 transitions. [2023-12-24 20:43:53,434 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 387 transitions. Word has length 36 [2023-12-24 20:43:53,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:43:53,434 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 387 transitions. [2023-12-24 20:43:53,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.1875) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 20:43:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 387 transitions. [2023-12-24 20:43:53,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-24 20:43:53,435 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:43:53,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:43:53,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2023-12-24 20:43:53,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-24 20:43:53,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:43:53,842 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:43:53,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:43:53,843 INFO L85 PathProgramCache]: Analyzing trace with hash -424121341, now seen corresponding path program 1 times [2023-12-24 20:43:53,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:43:53,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265337811] [2023-12-24 20:43:53,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:43:53,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:43:53,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:43:53,845 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:43:53,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-24 20:43:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:43:54,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-24 20:43:54,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:43:54,202 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 20:43:54,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-24 20:43:54,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:43:54,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:43:56,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 37 treesize of output 42 [2023-12-24 20:43:56,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2023-12-24 20:43:56,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 41 treesize of output 46 [2023-12-24 20:43:56,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2023-12-24 20:43:56,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:43:56,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2023-12-24 20:43:56,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2023-12-24 20:43:56,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 19 [2023-12-24 20:43:56,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:43:56,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2023-12-24 20:43:56,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 40 [2023-12-24 20:43:56,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 31 [2023-12-24 20:43:59,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2023-12-24 20:43:59,851 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-24 20:43:59,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 23 [2023-12-24 20:44:00,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:44:00,006 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:44:00,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:44:00,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1265337811] [2023-12-24 20:44:00,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1265337811] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:44:00,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:44:00,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-24 20:44:00,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560724782] [2023-12-24 20:44:00,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:44:00,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 20:44:00,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:44:00,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 20:44:00,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2023-12-24 20:44:00,008 INFO L87 Difference]: Start difference. First operand 319 states and 387 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:44:04,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:44:12,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:44:12,613 INFO L93 Difference]: Finished difference Result 331 states and 397 transitions. [2023-12-24 20:44:12,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 20:44:12,615 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2023-12-24 20:44:12,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:44:12,617 INFO L225 Difference]: With dead ends: 331 [2023-12-24 20:44:12,617 INFO L226 Difference]: Without dead ends: 326 [2023-12-24 20:44:12,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2023-12-24 20:44:12,618 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 264 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 22 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2023-12-24 20:44:12,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 512 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 936 Invalid, 12 Unknown, 0 Unchecked, 10.6s Time] [2023-12-24 20:44:12,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2023-12-24 20:44:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 319. [2023-12-24 20:44:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 275 states have (on average 1.221818181818182) internal successors, (336), 291 states have internal predecessors, (336), 33 states have call successors, (33), 12 states have call predecessors, (33), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 20:44:12,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 384 transitions. [2023-12-24 20:44:12,674 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 384 transitions. Word has length 38 [2023-12-24 20:44:12,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:44:12,674 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 384 transitions. [2023-12-24 20:44:12,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:44:12,674 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 384 transitions. [2023-12-24 20:44:12,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-24 20:44:12,675 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:44:12,675 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:44:12,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-24 20:44:12,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:44:12,882 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:44:12,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:44:12,883 INFO L85 PathProgramCache]: Analyzing trace with hash -528930837, now seen corresponding path program 1 times [2023-12-24 20:44:12,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:44:12,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306143078] [2023-12-24 20:44:12,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:44:12,883 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:44:12,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:44:12,884 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:44:12,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-24 20:44:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:44:13,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-24 20:44:13,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:44:13,434 INFO L349 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-12-24 20:44:13,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-12-24 20:44:13,816 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 16 treesize of output 11 [2023-12-24 20:44:13,835 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 16 treesize of output 11 [2023-12-24 20:44:15,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2023-12-24 20:44:15,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 82 [2023-12-24 20:44:15,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-12-24 20:44:15,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:44:15,191 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 32 treesize of output 15 [2023-12-24 20:44:15,201 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 17 treesize of output 18 [2023-12-24 20:44:15,598 INFO L349 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2023-12-24 20:44:15,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 201 treesize of output 155 [2023-12-24 20:44:15,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 165 [2023-12-24 20:44:15,734 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 20:44:15,735 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 122 treesize of output 107 [2023-12-24 20:44:15,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2023-12-24 20:44:15,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 58 [2023-12-24 20:44:16,011 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:44:16,012 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:44:16,012 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:44:16,013 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:44:16,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 49 [2023-12-24 20:44:16,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:44:16,951 INFO L349 Elim1Store]: treesize reduction 38, result has 35.6 percent of original size [2023-12-24 20:44:16,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 44 [2023-12-24 20:44:17,447 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-24 20:44:17,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 40 [2023-12-24 20:44:17,473 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 69 treesize of output 52 [2023-12-24 20:44:18,192 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-24 20:44:18,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 95 [2023-12-24 20:44:18,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:44:18,368 INFO L349 Elim1Store]: treesize reduction 74, result has 12.9 percent of original size [2023-12-24 20:44:18,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 138 [2023-12-24 20:44:18,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:44:18,477 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2023-12-24 20:44:18,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 50 [2023-12-24 20:44:18,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2023-12-24 20:44:18,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 106 [2023-12-24 20:44:18,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 31 [2023-12-24 20:44:18,891 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-24 20:44:18,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 35 [2023-12-24 20:44:18,913 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 58 treesize of output 45 [2023-12-24 20:44:20,688 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 49 treesize of output 29 [2023-12-24 20:44:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:44:21,234 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:44:22,433 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1200 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1201 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1200)) (.cse2 (bvadd (_ bv4 32) |c_~#gl_list~0.offset|))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse2))) (= .cse0 (select (select .cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1201) |c_~#gl_list~0.base|) .cse2)) .cse0)))))) is different from false [2023-12-24 20:44:23,695 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1217 (_ BitVec 32)) (v_ArrVal_1222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1200 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1219 (_ BitVec 32)) (v_ArrVal_1218 (_ BitVec 32)) (v_ArrVal_1220 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1201 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse1 (store (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| .cse3 (store (select |c_#memory_$Pointer$#1.offset| .cse3) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) v_ArrVal_1219)))) (store .cse5 |c_~#gl_list~0.base| (store (select (store .cse5 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1222) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_1218))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1200)) (.cse4 (bvadd (_ bv4 32) |c_~#gl_list~0.offset|))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse4))) (= .cse0 (select (select .cse1 (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1220))) (store .cse2 |c_~#gl_list~0.base| (store (select (store .cse2 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1221) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_1217))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1201) |c_~#gl_list~0.base|) .cse4)) .cse0))))))) is different from false [2023-12-24 20:44:23,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:44:23,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306143078] [2023-12-24 20:44:23,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306143078] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:44:23,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1062219382] [2023-12-24 20:44:23,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:44:23,715 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 20:44:23,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 20:44:23,716 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 20:44:23,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-12-24 20:44:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:44:24,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 74 conjunts are in the unsatisfiable core [2023-12-24 20:44:24,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:44:24,783 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 20:44:24,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 20:44:25,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:44:25,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:44:31,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 90 [2023-12-24 20:44:31,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 48 [2023-12-24 20:44:31,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:44:31,666 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 30 treesize of output 15 [2023-12-24 20:44:31,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-12-24 20:44:31,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2023-12-24 20:44:31,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2023-12-24 20:44:32,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:44:32,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2023-12-24 20:44:32,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 41 [2023-12-24 20:44:32,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 65 [2023-12-24 20:44:32,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2023-12-24 20:44:33,639 INFO L349 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2023-12-24 20:44:33,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2023-12-24 20:44:34,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-12-24 20:44:34,342 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-24 20:44:34,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 59 [2023-12-24 20:44:34,950 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_old(#memory_$Pointer$#1.offset)| |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|))) (let ((.cse7 (bvadd (_ bv4 32) |c_list_add_#in~new#1.offset|)) (.cse3 (select (select |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|)) (.cse9 (bvadd (_ bv4 32) .cse6))) (and (let ((.cse8 (select |c_old(#memory_$Pointer$#1.offset)| .cse3))) (let ((.cse0 (= .cse3 |c_list_add_#in~head#1.base|)) (.cse2 (= |c_list_add_#in~new#1.base| .cse3)) (.cse1 (exists ((v_ArrVal_1350 (_ BitVec 32)) (v_ArrVal_1343 (_ BitVec 32))) (= (let ((.cse11 (store |c_old(#memory_$Pointer$#1.offset)| .cse3 (store .cse8 .cse9 v_ArrVal_1343)))) (let ((.cse10 (store (store (select .cse11 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse6) .cse7 v_ArrVal_1350))) (store (store |c_old(#memory_$Pointer$#1.offset)| |c_list_add_#in~new#1.base| .cse10) |c_list_add_#in~head#1.base| (store (select (store .cse11 |c_list_add_#in~new#1.base| .cse10) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|)))) |c_#memory_$Pointer$#1.offset|)))) (or (and .cse0 .cse1) (and (not .cse2) (exists ((v_ArrVal_1350 (_ BitVec 32)) (v_ArrVal_1343 (_ BitVec 32))) (= (let ((.cse5 (store |c_old(#memory_$Pointer$#1.offset)| .cse3 (store .cse8 .cse9 v_ArrVal_1343)))) (let ((.cse4 (store (store (select .cse5 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse6) .cse7 v_ArrVal_1350))) (store (store (store |c_old(#memory_$Pointer$#1.offset)| .cse3 (select |c_#memory_$Pointer$#1.offset| .cse3)) |c_list_add_#in~new#1.base| .cse4) |c_list_add_#in~head#1.base| (store (select (store .cse5 |c_list_add_#in~new#1.base| .cse4) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|)))) |c_#memory_$Pointer$#1.offset|)) (not .cse0)) (and .cse2 .cse1)))) (= (_ bv3 32) |c_~#gl_list~0.base|) (= |c_~#gl_list~0.offset| (_ bv0 32)) (= (let ((.cse12 (let ((.cse13 (store |c_old(#memory_$Pointer$#1.base)| .cse3 (store (select |c_old(#memory_$Pointer$#1.base)| .cse3) .cse9 |c_list_add_#in~new#1.base|)))) (store .cse13 |c_list_add_#in~new#1.base| (store (store (select .cse13 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse3) .cse7 |c_list_add_#in~head#1.base|))))) (store .cse12 |c_list_add_#in~head#1.base| (store (select .cse12 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| (select (select |c_#memory_$Pointer$#1.base| |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|)))) |c_#memory_$Pointer$#1.base|)))) is different from true [2023-12-24 20:44:35,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:44:35,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 281 treesize of output 571 [2023-12-24 20:44:36,165 INFO L349 Elim1Store]: treesize reduction 81, result has 15.6 percent of original size [2023-12-24 20:44:36,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 17 case distinctions, treesize of input 621 treesize of output 351 [2023-12-24 20:44:39,828 INFO L349 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2023-12-24 20:44:39,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 821 treesize of output 702 [2023-12-24 20:44:39,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:44:39,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:44:39,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:44:39,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 91 [2023-12-24 20:44:39,872 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 74 treesize of output 52 [2023-12-24 20:44:39,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2023-12-24 20:44:39,987 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:44:39,996 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:44:39,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-24 20:44:43,446 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-12-24 20:44:43,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 34 [2023-12-24 20:44:43,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-24 20:44:43,834 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:44:45,924 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1351)) (.cse2 (bvadd (_ bv4 32) |c_~#gl_list~0.offset|))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse2))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1352) |c_~#gl_list~0.base|) .cse2))))))) is different from false [2023-12-24 20:44:55,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1062219382] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:44:55,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:44:55,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2023-12-24 20:44:55,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177102849] [2023-12-24 20:44:55,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:44:55,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-24 20:44:55,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:44:55,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-24 20:44:55,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1503, Unknown=31, NotChecked=324, Total=1980 [2023-12-24 20:44:55,854 INFO L87 Difference]: Start difference. First operand 319 states and 384 transitions. Second operand has 31 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 21 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-24 20:45:21,924 WARN L293 SmtUtils]: Spent 12.16s on a formula simplification. DAG size of input: 143 DAG size of output: 127 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 20:45:24,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:46:33,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:46:33,929 INFO L93 Difference]: Finished difference Result 350 states and 414 transitions. [2023-12-24 20:46:33,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-24 20:46:33,930 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 21 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 39 [2023-12-24 20:46:33,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:46:33,932 INFO L225 Difference]: With dead ends: 350 [2023-12-24 20:46:33,932 INFO L226 Difference]: Without dead ends: 347 [2023-12-24 20:46:33,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 56.0s TimeCoverageRelationStatistics Valid=352, Invalid=3041, Unknown=45, NotChecked=468, Total=3906 [2023-12-24 20:46:33,934 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 897 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 4152 mSolverCounterSat, 124 mSolverCounterUnsat, 181 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 4786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 4152 IncrementalHoareTripleChecker+Invalid, 181 IncrementalHoareTripleChecker+Unknown, 329 IncrementalHoareTripleChecker+Unchecked, 64.8s IncrementalHoareTripleChecker+Time [2023-12-24 20:46:33,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 1042 Invalid, 4786 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [124 Valid, 4152 Invalid, 181 Unknown, 329 Unchecked, 64.8s Time] [2023-12-24 20:46:33,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2023-12-24 20:46:34,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 319. [2023-12-24 20:46:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 275 states have (on average 1.2181818181818183) internal successors, (335), 291 states have internal predecessors, (335), 33 states have call successors, (33), 12 states have call predecessors, (33), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 20:46:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 383 transitions. [2023-12-24 20:46:34,007 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 383 transitions. Word has length 39 [2023-12-24 20:46:34,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:46:34,007 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 383 transitions. [2023-12-24 20:46:34,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 21 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-24 20:46:34,008 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 383 transitions. [2023-12-24 20:46:34,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-24 20:46:34,008 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:46:34,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:46:34,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-24 20:46:34,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2023-12-24 20:46:34,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 20:46:34,415 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:46:34,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:46:34,416 INFO L85 PathProgramCache]: Analyzing trace with hash 616504430, now seen corresponding path program 1 times [2023-12-24 20:46:34,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:46:34,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502612920] [2023-12-24 20:46:34,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:46:34,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:46:34,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:46:34,418 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:46:34,418 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 (18)] Waiting until timeout for monitored process [2023-12-24 20:46:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:46:34,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-24 20:46:34,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:46:34,792 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 20:46:34,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-24 20:46:34,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:46:35,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:46:35,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 41 treesize of output 46 [2023-12-24 20:46:35,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2023-12-24 20:46:35,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 41 treesize of output 46 [2023-12-24 20:46:35,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2023-12-24 20:46:36,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:46:36,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2023-12-24 20:46:36,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2023-12-24 20:46:36,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:46:36,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2023-12-24 20:46:36,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2023-12-24 20:46:36,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 40 [2023-12-24 20:46:36,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2023-12-24 20:46:39,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2023-12-24 20:46:39,427 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-24 20:46:39,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 23 [2023-12-24 20:46:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:46:39,644 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:46:39,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:46:39,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502612920] [2023-12-24 20:46:39,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502612920] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:46:39,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:46:39,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-24 20:46:39,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122967527] [2023-12-24 20:46:39,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:46:39,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 20:46:39,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:46:39,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 20:46:39,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=131, Unknown=2, NotChecked=0, Total=156 [2023-12-24 20:46:39,645 INFO L87 Difference]: Start difference. First operand 319 states and 383 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:46:50,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:46:50,577 INFO L93 Difference]: Finished difference Result 328 states and 390 transitions. [2023-12-24 20:46:50,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 20:46:50,577 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2023-12-24 20:46:50,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:46:50,579 INFO L225 Difference]: With dead ends: 328 [2023-12-24 20:46:50,579 INFO L226 Difference]: Without dead ends: 325 [2023-12-24 20:46:50,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=93, Invalid=406, Unknown=7, NotChecked=0, Total=506 [2023-12-24 20:46:50,580 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 256 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 18 mSolverCounterUnsat, 72 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 72 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-12-24 20:46:50,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 519 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 932 Invalid, 72 Unknown, 0 Unchecked, 8.8s Time] [2023-12-24 20:46:50,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2023-12-24 20:46:50,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 319. [2023-12-24 20:46:50,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 275 states have (on average 1.2145454545454546) internal successors, (334), 291 states have internal predecessors, (334), 33 states have call successors, (33), 12 states have call predecessors, (33), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 20:46:50,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 382 transitions. [2023-12-24 20:46:50,661 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 382 transitions. Word has length 41 [2023-12-24 20:46:50,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:46:50,661 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 382 transitions. [2023-12-24 20:46:50,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:46:50,661 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 382 transitions. [2023-12-24 20:46:50,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-24 20:46:50,662 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:46:50,662 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:46:50,668 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 (18)] Forceful destruction successful, exit code 0 [2023-12-24 20:46:50,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:46:50,868 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:46:50,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:46:50,868 INFO L85 PathProgramCache]: Analyzing trace with hash 633952030, now seen corresponding path program 1 times [2023-12-24 20:46:50,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:46:50,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896237191] [2023-12-24 20:46:50,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:46:50,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:46:50,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:46:50,869 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:46:50,870 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 (19)] Waiting until timeout for monitored process [2023-12-24 20:46:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:46:51,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-24 20:46:51,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:46:51,460 INFO L349 Elim1Store]: treesize reduction 66, result has 34.0 percent of original size [2023-12-24 20:46:51,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 59 [2023-12-24 20:46:51,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:46:51,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:46:54,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-12-24 20:46:54,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2023-12-24 20:46:54,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-12-24 20:46:54,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2023-12-24 20:46:54,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:46:54,777 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 34 treesize of output 21 [2023-12-24 20:46:54,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:46:54,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2023-12-24 20:46:54,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2023-12-24 20:46:54,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2023-12-24 20:46:55,742 INFO L349 Elim1Store]: treesize reduction 44, result has 36.2 percent of original size [2023-12-24 20:46:55,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 53 [2023-12-24 20:46:56,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2023-12-24 20:46:56,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 37 [2023-12-24 20:46:58,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 131 [2023-12-24 20:46:58,170 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2023-12-24 20:46:58,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 167 treesize of output 113 [2023-12-24 20:46:58,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:46:58,242 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2023-12-24 20:46:58,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 137 treesize of output 120 [2023-12-24 20:46:58,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 82 [2023-12-24 20:46:58,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:46:58,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 51 [2023-12-24 20:46:58,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 36 [2023-12-24 20:46:58,774 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-12-24 20:46:58,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 191 treesize of output 146 [2023-12-24 20:46:58,849 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-24 20:46:58,849 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 131 treesize of output 124 [2023-12-24 20:47:01,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 78 [2023-12-24 20:47:01,998 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2023-12-24 20:47:01,998 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 45 [2023-12-24 20:47:02,391 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:47:02,391 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:47:04,092 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1561 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1562)) (.cse2 (bvadd (_ bv4 32) |c_~#gl_list~0.offset|))) (let ((.cse1 (select (select .cse0 |c_~#gl_list~0.base|) .cse2))) (= (select (select .cse0 .cse1) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1561) |c_~#gl_list~0.base|) .cse2))) .cse1))))) is different from false [2023-12-24 20:47:06,180 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1584 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1579 (_ BitVec 32)) (v_ArrVal_1582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1581 (_ BitVec 32)) (v_ArrVal_1580 (_ BitVec 32))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (let ((.cse1 (store (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse2 (store (select |c_#memory_$Pointer$#1.base| .cse2) .cse3 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store .cse5 |c_~#gl_list~0.base| (store (select (store .cse5 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1583) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_1580))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1562)) (.cse4 (bvadd (_ bv4 32) |c_~#gl_list~0.offset|))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse4))) (= .cse0 (select (select .cse1 .cse0) (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1584) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 (store (select |c_#memory_$Pointer$#1.offset| .cse2) .cse3 v_ArrVal_1581)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1582) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_1579)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1561) |c_~#gl_list~0.base|) .cse4))))))))) is different from false [2023-12-24 20:47:06,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:47:06,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896237191] [2023-12-24 20:47:06,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896237191] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:47:06,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [717210516] [2023-12-24 20:47:06,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:47:06,195 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 20:47:06,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 20:47:06,196 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 20:47:06,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-12-24 20:47:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:47:07,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 72 conjunts are in the unsatisfiable core [2023-12-24 20:47:07,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:47:07,574 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 20:47:07,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 20:47:08,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:47:08,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:47:12,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 90 [2023-12-24 20:47:12,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:47:12,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 50 treesize of output 36 [2023-12-24 20:47:12,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2023-12-24 20:47:12,260 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 21 treesize of output 5 [2023-12-24 20:47:12,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 37 treesize of output 42 [2023-12-24 20:47:12,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2023-12-24 20:47:12,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:47:12,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2023-12-24 20:47:12,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2023-12-24 20:47:12,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2023-12-24 20:47:13,797 INFO L349 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2023-12-24 20:47:13,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2023-12-24 20:47:14,390 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 36 treesize of output 25 [2023-12-24 20:47:14,432 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 23 treesize of output 16 [2023-12-24 20:47:14,957 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_old(#memory_$Pointer$#1.offset)| |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|))) (let ((.cse3 (bvadd (_ bv4 32) |c_list_add_#in~new#1.offset|)) (.cse4 (bvadd (_ bv4 32) .cse9)) (.cse2 (select (select |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|))) (and (= (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$#1.base)| .cse2 (store (select |c_old(#memory_$Pointer$#1.base)| .cse2) .cse4 |c_list_add_#in~new#1.base|)))) (store .cse1 |c_list_add_#in~new#1.base| (store (store (select .cse1 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse2) .cse3 |c_list_add_#in~head#1.base|))))) (store .cse0 |c_list_add_#in~head#1.base| (store (select .cse0 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))) |c_#memory_$Pointer$#1.base|) (= (_ bv3 32) |c_~#gl_list~0.base|) (= |c_~#gl_list~0.offset| (_ bv0 32)) (let ((.cse10 (select |c_old(#memory_$Pointer$#1.offset)| .cse2))) (let ((.cse5 (= .cse2 |c_list_add_#in~head#1.base|)) (.cse11 (= |c_list_add_#in~new#1.base| .cse2)) (.cse6 (exists ((v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1705 (_ BitVec 32))) (= (let ((.cse13 (store |c_old(#memory_$Pointer$#1.offset)| .cse2 (store .cse10 .cse4 v_ArrVal_1701)))) (let ((.cse12 (store (store (select .cse13 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse9) .cse3 v_ArrVal_1705))) (store (store |c_old(#memory_$Pointer$#1.offset)| |c_list_add_#in~new#1.base| .cse12) |c_list_add_#in~head#1.base| (store (select (store .cse13 |c_list_add_#in~new#1.base| .cse12) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|)))) |c_#memory_$Pointer$#1.offset|)))) (or (and .cse5 .cse6) (and (exists ((v_ArrVal_1701 (_ BitVec 32)) (v_ArrVal_1705 (_ BitVec 32))) (= (let ((.cse8 (store |c_old(#memory_$Pointer$#1.offset)| .cse2 (store .cse10 .cse4 v_ArrVal_1701)))) (let ((.cse7 (store (store (select .cse8 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse9) .cse3 v_ArrVal_1705))) (store (store (store |c_old(#memory_$Pointer$#1.offset)| .cse2 (select |c_#memory_$Pointer$#1.offset| .cse2)) |c_list_add_#in~new#1.base| .cse7) |c_list_add_#in~head#1.base| (store (select (store .cse8 |c_list_add_#in~new#1.base| .cse7) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|)))) |c_#memory_$Pointer$#1.offset|)) (not .cse11) (not .cse5)) (and .cse11 .cse6))))))) is different from true [2023-12-24 20:47:15,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:47:15,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 281 treesize of output 571 [2023-12-24 20:47:15,623 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-24 20:47:15,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 565 treesize of output 322 [2023-12-24 20:47:15,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:47:15,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:47:15,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:47:15,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:47:15,919 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:47:16,033 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:47:16,034 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:47:16,478 INFO L224 Elim1Store]: Index analysis took 711 ms [2023-12-24 20:47:16,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 299 treesize of output 318 [2023-12-24 20:47:19,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:47:19,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:47:19,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:47:19,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:47:19,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:47:19,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 254 [2023-12-24 20:47:19,856 INFO L349 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2023-12-24 20:47:19,856 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 426 treesize of output 309 [2023-12-24 20:47:19,885 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 314 treesize of output 282 [2023-12-24 20:47:19,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 17 treesize of output 8 [2023-12-24 20:47:19,955 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 8 treesize of output 1 [2023-12-24 20:47:22,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:47:22,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:47:22,737 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 26 treesize of output 22 [2023-12-24 20:47:23,534 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-24 20:47:23,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 28 [2023-12-24 20:47:23,890 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-24 20:47:23,890 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:47:24,121 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1714)) (.cse2 (bvadd (_ bv4 32) |c_~#gl_list~0.offset|))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse2))) (= .cse0 (select (select .cse1 .cse0) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1713) |c_~#gl_list~0.base|) .cse2)))))))) is different from false [2023-12-24 20:47:27,770 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1730 (_ BitVec 32)) (v_ArrVal_1731 (_ BitVec 32)) (v_ArrVal_1732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1714 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_gl_insert_~node~1#1.offset|)) (.cse6 (bvadd (_ bv8 32) |c_ULTIMATE.start_gl_insert_~node~1#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (.cse7 (bvadd (_ bv4 32) .cse5))) (let ((.cse1 (store (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse2 (store (select |c_#memory_$Pointer$#1.base| .cse2) .cse7 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store .cse9 |c_~#gl_list~0.base| (store (select (store .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4 .cse2) .cse6 |c_~#gl_list~0.base|)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1714)) (.cse8 (bvadd (_ bv4 32) |c_~#gl_list~0.offset|))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse8))) (= .cse0 (select (select .cse1 .cse0) (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1732) |c_~#gl_list~0.base| (store (select (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| .cse2 (store (select |c_#memory_$Pointer$#1.offset| .cse2) .cse7 v_ArrVal_1730)))) (store .cse3 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse3 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4 .cse5) .cse6 v_ArrVal_1731))) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse4)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1713) |c_~#gl_list~0.base|) .cse8)))))))))) is different from false [2023-12-24 20:47:27,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [717210516] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:47:27,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:47:27,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2023-12-24 20:47:27,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353998595] [2023-12-24 20:47:27,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:47:27,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-24 20:47:27,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:47:27,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-24 20:47:27,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1098, Unknown=8, NotChecked=350, Total=1560 [2023-12-24 20:47:27,812 INFO L87 Difference]: Start difference. First operand 319 states and 382 transitions. Second operand has 31 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 21 states have internal predecessors, (71), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-24 20:48:39,100 WARN L293 SmtUtils]: Spent 49.84s on a formula simplification. DAG size of input: 174 DAG size of output: 165 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 20:49:25,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:49:25,217 INFO L93 Difference]: Finished difference Result 344 states and 403 transitions. [2023-12-24 20:49:25,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-24 20:49:25,219 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 21 states have internal predecessors, (71), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 42 [2023-12-24 20:49:25,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:49:25,220 INFO L225 Difference]: With dead ends: 344 [2023-12-24 20:49:25,220 INFO L226 Difference]: Without dead ends: 341 [2023-12-24 20:49:25,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 91.6s TimeCoverageRelationStatistics Valid=247, Invalid=2311, Unknown=12, NotChecked=510, Total=3080 [2023-12-24 20:49:25,223 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 622 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 3946 mSolverCounterSat, 87 mSolverCounterUnsat, 148 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 4499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 3946 IncrementalHoareTripleChecker+Invalid, 148 IncrementalHoareTripleChecker+Unknown, 318 IncrementalHoareTripleChecker+Unchecked, 42.5s IncrementalHoareTripleChecker+Time [2023-12-24 20:49:25,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 942 Invalid, 4499 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [87 Valid, 3946 Invalid, 148 Unknown, 318 Unchecked, 42.5s Time] [2023-12-24 20:49:25,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2023-12-24 20:49:25,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 319. [2023-12-24 20:49:25,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 275 states have (on average 1.210909090909091) internal successors, (333), 291 states have internal predecessors, (333), 33 states have call successors, (33), 12 states have call predecessors, (33), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 20:49:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 381 transitions. [2023-12-24 20:49:25,342 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 381 transitions. Word has length 42 [2023-12-24 20:49:25,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:49:25,342 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 381 transitions. [2023-12-24 20:49:25,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 21 states have internal predecessors, (71), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-24 20:49:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 381 transitions. [2023-12-24 20:49:25,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-24 20:49:25,343 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:49:25,343 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:49:25,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2023-12-24 20:49:25,557 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 (19)] Forceful destruction successful, exit code 0 [2023-12-24 20:49:25,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:49:25,752 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:49:25,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:49:25,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1986989242, now seen corresponding path program 2 times [2023-12-24 20:49:25,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:49:25,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066735087] [2023-12-24 20:49:25,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 20:49:25,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:49:25,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:49:25,754 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:49:25,755 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 (21)] Waiting until timeout for monitored process [2023-12-24 20:49:26,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 20:49:26,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 20:49:26,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 77 conjunts are in the unsatisfiable core [2023-12-24 20:49:26,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:49:26,554 INFO L349 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-12-24 20:49:26,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-12-24 20:49:26,870 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 16 treesize of output 11 [2023-12-24 20:49:26,930 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 16 treesize of output 11 [2023-12-24 20:49:28,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:49:28,607 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 22 treesize of output 14 [2023-12-24 20:49:28,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-24 20:49:28,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-12-24 20:49:28,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:49:28,670 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 36 treesize of output 19 [2023-12-24 20:49:28,681 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 21 treesize of output 11 [2023-12-24 20:49:29,090 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 20:49:29,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2023-12-24 20:49:29,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-24 20:49:29,914 INFO L349 Elim1Store]: treesize reduction 122, result has 30.3 percent of original size [2023-12-24 20:49:29,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 46 treesize of output 76 [2023-12-24 20:49:30,554 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 16 treesize of output 11 [2023-12-24 20:49:30,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2023-12-24 20:49:30,661 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 28 treesize of output 16 [2023-12-24 20:49:31,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 55 [2023-12-24 20:49:31,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:49:31,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2023-12-24 20:49:31,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-12-24 20:49:31,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:49:31,853 INFO L349 Elim1Store]: treesize reduction 66, result has 14.3 percent of original size [2023-12-24 20:49:31,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 111 [2023-12-24 20:49:31,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 62 [2023-12-24 20:49:31,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2023-12-24 20:49:32,477 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 20:49:32,477 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 65 treesize of output 56 [2023-12-24 20:49:32,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-24 20:49:33,784 INFO L349 Elim1Store]: treesize reduction 60, result has 25.9 percent of original size [2023-12-24 20:49:33,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 49 [2023-12-24 20:49:34,216 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 25 treesize of output 18 [2023-12-24 20:49:34,268 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 16 treesize of output 11 [2023-12-24 20:49:35,214 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 55 [2023-12-24 20:49:35,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:49:35,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2023-12-24 20:49:35,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-12-24 20:49:35,475 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 16 treesize of output 11 [2023-12-24 20:49:36,705 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 20:49:36,705 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:49:38,665 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1925 (_ BitVec 32)) (v_ArrVal_1926 (_ BitVec 32))) (not (= (select (select (store (let ((.cse0 (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (store |c_#memory_$Pointer$#1.offset| .cse1 (store (select |c_#memory_$Pointer$#1.offset| .cse1) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) v_ArrVal_1926))))) (store .cse0 |c_~#gl_list~0.base| (store (select (store .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1924) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_1925))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1915) |c_~#gl_list~0.base|) (bvadd (_ bv4 32) |c_~#gl_list~0.offset|)) |c_~#gl_list~0.offset|))) is different from false [2023-12-24 20:49:38,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:49:38,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066735087] [2023-12-24 20:49:38,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066735087] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:49:38,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [787732774] [2023-12-24 20:49:38,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 20:49:38,671 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 20:49:38,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 20:49:38,672 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 20:49:38,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-12-24 20:49:40,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 20:49:40,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 20:49:40,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 76 conjunts are in the unsatisfiable core [2023-12-24 20:49:40,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:49:41,335 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-12-24 20:49:41,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-12-24 20:49:41,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:49:41,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:49:42,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 37 treesize of output 42 [2023-12-24 20:49:42,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2023-12-24 20:49:43,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:49:43,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2023-12-24 20:49:43,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2023-12-24 20:49:43,861 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 20:49:43,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 20:49:48,345 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 28 treesize of output 19 [2023-12-24 20:49:50,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:49:51,369 INFO L349 Elim1Store]: treesize reduction 148, result has 20.0 percent of original size [2023-12-24 20:49:51,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 198 treesize of output 325 [2023-12-24 20:49:51,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 233 [2023-12-24 20:49:51,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2023-12-24 20:49:51,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:49:51,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:49:51,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:49:51,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 38 [2023-12-24 20:49:52,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 128 [2023-12-24 20:49:52,360 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-24 20:49:52,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2023-12-24 20:49:52,571 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 (21)] Forceful destruction successful, exit code 0 [2023-12-24 20:49:52,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:49:52,765 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-24 20:49:52,768 INFO L158 Benchmark]: Toolchain (without parser) took 526553.54ms. Allocated memory was 184.5MB in the beginning and 280.0MB in the end (delta: 95.4MB). Free memory was 139.3MB in the beginning and 104.1MB in the end (delta: 35.2MB). Peak memory consumption was 156.0MB. Max. memory is 8.0GB. [2023-12-24 20:49:52,768 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 20:49:52,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 647.42ms. Allocated memory is still 184.5MB. Free memory was 138.9MB in the beginning and 103.6MB in the end (delta: 35.3MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2023-12-24 20:49:52,768 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.70ms. Allocated memory is still 184.5MB. Free memory was 103.6MB in the beginning and 159.3MB in the end (delta: -55.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-12-24 20:49:52,769 INFO L158 Benchmark]: Boogie Preprocessor took 107.39ms. Allocated memory is still 184.5MB. Free memory was 158.7MB in the beginning and 154.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-24 20:49:52,769 INFO L158 Benchmark]: RCFGBuilder took 705.39ms. Allocated memory is still 184.5MB. Free memory was 153.5MB in the beginning and 118.9MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2023-12-24 20:49:52,769 INFO L158 Benchmark]: TraceAbstraction took 524981.74ms. Allocated memory was 184.5MB in the beginning and 280.0MB in the end (delta: 95.4MB). Free memory was 118.4MB in the beginning and 104.1MB in the end (delta: 14.3MB). Peak memory consumption was 134.1MB. Max. memory is 8.0GB. [2023-12-24 20:49:52,770 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.16ms. Allocated memory is still 184.5MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 647.42ms. Allocated memory is still 184.5MB. Free memory was 138.9MB in the beginning and 103.6MB in the end (delta: 35.3MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 105.70ms. Allocated memory is still 184.5MB. Free memory was 103.6MB in the beginning and 159.3MB in the end (delta: -55.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 107.39ms. Allocated memory is still 184.5MB. Free memory was 158.7MB in the beginning and 154.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 705.39ms. Allocated memory is still 184.5MB. Free memory was 153.5MB in the beginning and 118.9MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 524981.74ms. Allocated memory was 184.5MB in the beginning and 280.0MB in the end (delta: 95.4MB). Free memory was 118.4MB in the beginning and 104.1MB in the end (delta: 14.3MB). Peak memory consumption was 134.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-12-24 20:49:52,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...