/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/sll2c_insert_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:21:05,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:21:06,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 16:21:06,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:21:06,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:21:06,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:21:06,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:21:06,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:21:06,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:21:06,071 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:21:06,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:21:06,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:21:06,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:21:06,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:21:06,074 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:21:06,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:21:06,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:21:06,075 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:21:06,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:21:06,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:21:06,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:21:06,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:21:06,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:21:06,076 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:21:06,076 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:21:06,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:21:06,077 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:21:06,077 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:21:06,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:21:06,077 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:21:06,078 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:21:06,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:21:06,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:21:06,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:21:06,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:21:06,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:21:06,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:21:06,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:21:06,079 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:21:06,079 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:21:06,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:21:06,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:21:06,079 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:21:06,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:21:06,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:21:06,080 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:21:06,080 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 16:21:06,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:21:06,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:21:06,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:21:06,294 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:21:06,294 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:21:06,295 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_insert_equal.i [2023-12-16 16:21:07,460 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:21:07,686 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:21:07,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_insert_equal.i [2023-12-16 16:21:07,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f2a4f0bd/873eb48fd40c4fdc952b525f08b383ca/FLAG197aa40df [2023-12-16 16:21:07,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f2a4f0bd/873eb48fd40c4fdc952b525f08b383ca [2023-12-16 16:21:07,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:21:07,711 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:21:07,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:21:07,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:21:07,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:21:07,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:21:07" (1/1) ... [2023-12-16 16:21:07,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1932af72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:07, skipping insertion in model container [2023-12-16 16:21:07,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:21:07" (1/1) ... [2023-12-16 16:21:07,759 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:21:08,005 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_insert_equal.i[24601,24614] [2023-12-16 16:21:08,011 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:21:08,027 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:21:08,071 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_insert_equal.i[24601,24614] [2023-12-16 16:21:08,073 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:21:08,098 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:21:08,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:08 WrapperNode [2023-12-16 16:21:08,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:21:08,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:21:08,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:21:08,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:21:08,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:08" (1/1) ... [2023-12-16 16:21:08,134 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:08" (1/1) ... [2023-12-16 16:21:08,162 INFO L138 Inliner]: procedures = 130, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 144 [2023-12-16 16:21:08,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:21:08,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:21:08,167 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:21:08,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:21:08,175 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:08" (1/1) ... [2023-12-16 16:21:08,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:08" (1/1) ... [2023-12-16 16:21:08,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:08" (1/1) ... [2023-12-16 16:21:08,194 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 14, 9]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2023-12-16 16:21:08,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:08" (1/1) ... [2023-12-16 16:21:08,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:08" (1/1) ... [2023-12-16 16:21:08,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:08" (1/1) ... [2023-12-16 16:21:08,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:08" (1/1) ... [2023-12-16 16:21:08,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:08" (1/1) ... [2023-12-16 16:21:08,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:08" (1/1) ... [2023-12-16 16:21:08,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:21:08,211 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:21:08,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:21:08,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:21:08,212 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:08" (1/1) ... [2023-12-16 16:21:08,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:21:08,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:21:08,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 16:21:08,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 16:21:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 16:21:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 16:21:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-16 16:21:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-16 16:21:08,261 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-16 16:21:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 16:21:08,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:21:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 16:21:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-16 16:21:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-16 16:21:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-16 16:21:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-16 16:21:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-16 16:21:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-16 16:21:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 16:21:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 16:21:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 16:21:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-16 16:21:08,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-16 16:21:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-16 16:21:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-16 16:21:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:21:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 16:21:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 16:21:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:21:08,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:21:08,406 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:21:08,408 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:21:08,664 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:21:08,688 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:21:08,688 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-16 16:21:08,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:21:08 BoogieIcfgContainer [2023-12-16 16:21:08,689 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:21:08,690 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:21:08,690 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:21:08,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:21:08,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:21:07" (1/3) ... [2023-12-16 16:21:08,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb7d37e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:21:08, skipping insertion in model container [2023-12-16 16:21:08,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:21:08" (2/3) ... [2023-12-16 16:21:08,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb7d37e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:21:08, skipping insertion in model container [2023-12-16 16:21:08,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:21:08" (3/3) ... [2023-12-16 16:21:08,694 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2023-12-16 16:21:08,706 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:21:08,707 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:21:08,735 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:21:08,739 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;@683ac86e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:21:08,739 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:21:08,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 16:21:08,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-16 16:21:08,748 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:21:08,748 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:21:08,748 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:21:08,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:21:08,752 INFO L85 PathProgramCache]: Analyzing trace with hash 714646386, now seen corresponding path program 1 times [2023-12-16 16:21:08,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:21:08,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46959276] [2023-12-16 16:21:08,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:21:08,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:08,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:21:08,766 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:21:08,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 16:21:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:21:08,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 16:21:08,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:21:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 16:21:08,916 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:21:08,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:21:08,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46959276] [2023-12-16 16:21:08,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46959276] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:21:08,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:21:08,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:21:08,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64292434] [2023-12-16 16:21:08,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:21:08,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 16:21:08,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:21:08,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 16:21:08,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:21:08,942 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 16:21:09,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:21:09,025 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2023-12-16 16:21:09,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 16:21:09,027 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-12-16 16:21:09,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:21:09,031 INFO L225 Difference]: With dead ends: 54 [2023-12-16 16:21:09,031 INFO L226 Difference]: Without dead ends: 23 [2023-12-16 16:21:09,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:21:09,039 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:21:09,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:21:09,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-16 16:21:09,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-16 16:21:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 16:21:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2023-12-16 16:21:09,065 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 19 [2023-12-16 16:21:09,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:21:09,066 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2023-12-16 16:21:09,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 16:21:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2023-12-16 16:21:09,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-16 16:21:09,067 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:21:09,067 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:21:09,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 16:21:09,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:09,273 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:21:09,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:21:09,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1934433391, now seen corresponding path program 1 times [2023-12-16 16:21:09,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:21:09,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262136016] [2023-12-16 16:21:09,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:21:09,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:09,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:21:09,275 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:21:09,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 16:21:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:21:09,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 16:21:09,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:21:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:21:09,434 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:21:09,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:21:09,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262136016] [2023-12-16 16:21:09,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262136016] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:21:09,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:21:09,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 16:21:09,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248286731] [2023-12-16 16:21:09,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:21:09,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:21:09,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:21:09,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:21:09,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:21:09,436 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:21:09,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:21:09,497 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2023-12-16 16:21:09,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:21:09,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-12-16 16:21:09,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:21:09,499 INFO L225 Difference]: With dead ends: 43 [2023-12-16 16:21:09,499 INFO L226 Difference]: Without dead ends: 26 [2023-12-16 16:21:09,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:21:09,500 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:21:09,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 45 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:21:09,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-16 16:21:09,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-12-16 16:21:09,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 16:21:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-16 16:21:09,504 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 19 [2023-12-16 16:21:09,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:21:09,505 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-16 16:21:09,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:21:09,505 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-16 16:21:09,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-16 16:21:09,505 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:21:09,505 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:21:09,513 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-16 16:21:09,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:09,716 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:21:09,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:21:09,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1461155078, now seen corresponding path program 1 times [2023-12-16 16:21:09,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:21:09,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993531265] [2023-12-16 16:21:09,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:21:09,717 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:09,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:21:09,719 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:21:09,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 16:21:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:21:09,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 16:21:09,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:21:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 16:21:09,912 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:21:09,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:21:09,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993531265] [2023-12-16 16:21:09,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993531265] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:21:09,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:21:09,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:21:09,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164983176] [2023-12-16 16:21:09,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:21:09,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:21:09,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:21:09,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:21:09,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:21:09,919 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 16:21:10,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:21:10,001 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2023-12-16 16:21:10,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:21:10,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2023-12-16 16:21:10,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:21:10,002 INFO L225 Difference]: With dead ends: 35 [2023-12-16 16:21:10,002 INFO L226 Difference]: Without dead ends: 25 [2023-12-16 16:21:10,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:21:10,003 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:21:10,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 48 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:21:10,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-16 16:21:10,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-16 16:21:10,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 16:21:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-12-16 16:21:10,008 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 25 [2023-12-16 16:21:10,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:21:10,008 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-12-16 16:21:10,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 16:21:10,008 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-12-16 16:21:10,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 16:21:10,009 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:21:10,009 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:21:10,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-16 16:21:10,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:10,213 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:21:10,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:21:10,213 INFO L85 PathProgramCache]: Analyzing trace with hash -810442196, now seen corresponding path program 1 times [2023-12-16 16:21:10,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:21:10,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190046] [2023-12-16 16:21:10,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:21:10,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:10,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:21:10,215 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:21:10,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 16:21:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:21:10,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 59 conjunts are in the unsatisfiable core [2023-12-16 16:21:10,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:21:10,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-16 16:21:10,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 16:21:10,704 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-16 16:21:10,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-16 16:21:10,774 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 11 [2023-12-16 16:21:10,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-16 16:21:10,958 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 11 treesize of output 3 [2023-12-16 16:21:10,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 16:21:11,115 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-16 16:21:11,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-12-16 16:21:11,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-16 16:21:11,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-12-16 16:21:11,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-16 16:21:11,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 16:21:11,516 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:21:11,516 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:21:11,996 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_12| (_ BitVec 32)) (v_ArrVal_222 (_ BitVec 32)) (v_ArrVal_227 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_12|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_12| v_ArrVal_227) .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_222))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_12| v_ArrVal_223) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-12-16 16:21:11,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:21:12,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190046] [2023-12-16 16:21:12,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190046] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 16:21:12,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2094354051] [2023-12-16 16:21:12,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:21:12,000 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 16:21:12,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 16:21:12,092 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 16:21:12,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-16 16:21:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:21:12,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 59 conjunts are in the unsatisfiable core [2023-12-16 16:21:12,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:21:12,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-16 16:21:12,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 16:21:12,636 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-16 16:21:12,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-16 16:21:12,758 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 11 [2023-12-16 16:21:12,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-16 16:21:13,057 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 11 treesize of output 3 [2023-12-16 16:21:13,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 16:21:17,293 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-16 16:21:17,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-12-16 16:21:17,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-16 16:21:17,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-12-16 16:21:17,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-16 16:21:17,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 16:21:17,779 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:21:17,779 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:21:18,394 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16| (_ BitVec 32)) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_299 (_ BitVec 32)) (v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16| v_ArrVal_303) .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_299))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16| v_ArrVal_298) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16|) (_ bv0 1))))) is different from false [2023-12-16 16:21:18,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2094354051] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 16:21:18,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:21:18,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 35 [2023-12-16 16:21:18,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131310571] [2023-12-16 16:21:18,417 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:21:18,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-16 16:21:18,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:21:18,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-16 16:21:18,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1701, Unknown=51, NotChecked=170, Total=2070 [2023-12-16 16:21:18,423 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 35 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 25 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 16:21:21,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:21:21,309 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2023-12-16 16:21:21,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 16:21:21,310 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 25 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2023-12-16 16:21:21,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:21:21,312 INFO L225 Difference]: With dead ends: 44 [2023-12-16 16:21:21,312 INFO L226 Difference]: Without dead ends: 42 [2023-12-16 16:21:21,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=235, Invalid=2584, Unknown=51, NotChecked=210, Total=3080 [2023-12-16 16:21:21,313 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 52 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:21:21,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 234 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-16 16:21:21,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-16 16:21:21,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2023-12-16 16:21:21,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 16:21:21,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2023-12-16 16:21:21,320 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 26 [2023-12-16 16:21:21,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:21:21,323 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2023-12-16 16:21:21,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 25 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 16:21:21,324 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2023-12-16 16:21:21,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-16 16:21:21,325 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:21:21,325 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:21:21,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 16:21:21,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2023-12-16 16:21:21,750 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 16:21:21,750 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:21:21,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:21:21,750 INFO L85 PathProgramCache]: Analyzing trace with hash -2113179334, now seen corresponding path program 2 times [2023-12-16 16:21:21,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:21:21,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578441923] [2023-12-16 16:21:21,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:21:21,751 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:21,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:21:21,752 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:21:21,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 16:21:21,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:21:21,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:21:21,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:21:21,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:21:21,913 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 16:21:21,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:21:22,299 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 16:21:22,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:21:22,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578441923] [2023-12-16 16:21:22,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578441923] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:21:22,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:21:22,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-16 16:21:22,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726625880] [2023-12-16 16:21:22,300 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:21:22,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 16:21:22,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:21:22,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 16:21:22,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:21:22,301 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 16:21:22,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:21:22,422 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2023-12-16 16:21:22,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 16:21:22,422 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 27 [2023-12-16 16:21:22,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:21:22,423 INFO L225 Difference]: With dead ends: 42 [2023-12-16 16:21:22,423 INFO L226 Difference]: Without dead ends: 31 [2023-12-16 16:21:22,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:21:22,424 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 40 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:21:22,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 94 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:21:22,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-16 16:21:22,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-16 16:21:22,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 16:21:22,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-12-16 16:21:22,429 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 27 [2023-12-16 16:21:22,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:21:22,429 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-12-16 16:21:22,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 16:21:22,429 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-12-16 16:21:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 16:21:22,430 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:21:22,430 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:21:22,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 16:21:22,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:22,635 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:21:22,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:21:22,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1443991612, now seen corresponding path program 1 times [2023-12-16 16:21:22,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:21:22,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964922934] [2023-12-16 16:21:22,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:21:22,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:22,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:21:22,637 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:21:22,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 16:21:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:21:22,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-16 16:21:22,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:21:22,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-16 16:21:22,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-12-16 16:21:22,958 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-12-16 16:21:22,958 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 17 treesize of output 17 [2023-12-16 16:21:23,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-12-16 16:21:23,081 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-12-16 16:21:23,082 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 53 treesize of output 46 [2023-12-16 16:21:23,109 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 20 [2023-12-16 16:21:23,149 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 35 treesize of output 19 [2023-12-16 16:21:23,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-16 16:21:23,172 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 16:21:23,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:21:23,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:21:23,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-16 16:21:23,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:21:23,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 64 [2023-12-16 16:21:23,231 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 40 treesize of output 34 [2023-12-16 16:21:23,281 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-16 16:21:23,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-16 16:21:23,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:21:23,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964922934] [2023-12-16 16:21:23,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964922934] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 16:21:23,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [122939950] [2023-12-16 16:21:23,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:21:23,376 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 16:21:23,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 16:21:23,377 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 16:21:23,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-12-16 16:21:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:21:23,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-16 16:21:23,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:21:23,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-16 16:21:23,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-12-16 16:21:23,943 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-12-16 16:21:23,944 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 17 treesize of output 17 [2023-12-16 16:21:24,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-12-16 16:21:24,187 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-16 16:21:24,188 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 41 treesize of output 34 [2023-12-16 16:21:24,252 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 16:21:24,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-12-16 16:21:24,314 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 35 treesize of output 19 [2023-12-16 16:21:24,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-16 16:21:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 16:21:24,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:21:24,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:21:24,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-16 16:21:24,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:21:24,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 64 [2023-12-16 16:21:24,352 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 40 treesize of output 34 [2023-12-16 16:21:24,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [122939950] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 16:21:24,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:21:24,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2023-12-16 16:21:24,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883963055] [2023-12-16 16:21:24,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:21:24,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-16 16:21:24,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:21:24,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-16 16:21:24,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2023-12-16 16:21:24,560 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 30 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 16:21:28,599 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-16 16:21:32,683 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-16 16:21:36,711 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-16 16:21:38,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:21:38,729 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2023-12-16 16:21:38,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-16 16:21:38,730 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2023-12-16 16:21:38,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:21:38,731 INFO L225 Difference]: With dead ends: 42 [2023-12-16 16:21:38,731 INFO L226 Difference]: Without dead ends: 39 [2023-12-16 16:21:38,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=150, Invalid=1490, Unknown=0, NotChecked=0, Total=1640 [2023-12-16 16:21:38,732 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 33 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2023-12-16 16:21:38,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 334 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 486 Invalid, 3 Unknown, 0 Unchecked, 13.9s Time] [2023-12-16 16:21:38,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-16 16:21:38,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2023-12-16 16:21:38,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 16:21:38,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-12-16 16:21:38,739 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 28 [2023-12-16 16:21:38,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:21:38,740 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-12-16 16:21:38,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 16:21:38,740 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-12-16 16:21:38,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 16:21:38,740 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:21:38,740 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:21:38,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2023-12-16 16:21:38,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 16:21:39,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:39,153 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:21:39,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:21:39,153 INFO L85 PathProgramCache]: Analyzing trace with hash 151574482, now seen corresponding path program 1 times [2023-12-16 16:21:39,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:21:39,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398956768] [2023-12-16 16:21:39,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:21:39,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:39,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:21:39,155 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:21:39,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 16:21:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:21:39,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 16:21:39,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:21:39,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-16 16:21:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 16:21:39,380 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:21:39,412 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-16 16:21:39,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:21:39,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398956768] [2023-12-16 16:21:39,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398956768] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:21:39,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:21:39,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2023-12-16 16:21:39,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388342719] [2023-12-16 16:21:39,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:21:39,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 16:21:39,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:21:39,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 16:21:39,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:21:39,413 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 16:21:43,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 16:21:48,013 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-16 16:21:48,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:21:48,013 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2023-12-16 16:21:48,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 16:21:48,015 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2023-12-16 16:21:48,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:21:48,016 INFO L225 Difference]: With dead ends: 40 [2023-12-16 16:21:48,016 INFO L226 Difference]: Without dead ends: 31 [2023-12-16 16:21:48,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-12-16 16:21:48,016 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-12-16 16:21:48,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 160 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2023-12-16 16:21:48,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-16 16:21:48,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-12-16 16:21:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 16:21:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-12-16 16:21:48,022 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 28 [2023-12-16 16:21:48,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:21:48,022 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-12-16 16:21:48,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 16:21:48,022 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-12-16 16:21:48,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 16:21:48,023 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:21:48,023 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:21:48,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 16:21:48,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:48,223 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:21:48,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:21:48,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1814025842, now seen corresponding path program 1 times [2023-12-16 16:21:48,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:21:48,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559575022] [2023-12-16 16:21:48,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:21:48,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:21:48,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:21:48,226 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:21:48,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-16 16:21:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:21:48,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-16 16:21:48,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:21:48,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-16 16:21:48,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-12-16 16:21:48,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 16:21:48,563 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-12-16 16:21:48,563 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 17 treesize of output 17 [2023-12-16 16:21:48,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-12-16 16:21:48,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-12-16 16:21:48,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:21:48,772 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 78 treesize of output 51 [2023-12-16 16:21:48,786 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-12-16 16:21:48,787 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 121 treesize of output 90 [2023-12-16 16:21:48,797 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 42 treesize of output 23 [2023-12-16 16:21:48,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 19 [2023-12-16 16:21:48,863 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 62 treesize of output 42 [2023-12-16 16:21:48,867 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 30 [2023-12-16 16:21:48,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-16 16:21:48,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-16 16:21:49,013 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 16:21:49,014 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:21:49,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:21:49,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 62 [2023-12-16 16:21:49,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:21:49,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 123 [2023-12-16 16:21:49,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:21:49,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 92 [2023-12-16 16:21:49,209 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 44 treesize of output 38 [2023-12-16 16:21:49,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:21:49,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 149 [2023-12-16 16:21:49,264 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 29 treesize of output 23 [2023-12-16 16:21:49,778 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (= .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))) (let ((.cse2 (and (or (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_64 (_ BitVec 32))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_631))) (or (not (= (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_632 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_632)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_632) v_arrayElimCell_64) .cse6))))) .cse5) (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_64 (_ BitVec 32))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_631))) (let ((.cse15 (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_632))) (or (not (= (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_632 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_632)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_arrayElimCell_64) .cse6)) (forall ((v_arrayElimCell_69 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_arrayElimCell_66) (bvadd (_ bv4 32) v_arrayElimCell_69)))))))))) (.cse1 (= .cse12 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|)) (.cse0 (and (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_67 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_631))) (or (not (= (store (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_632 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_632)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_632 (bvadd (_ bv4 32) v_arrayElimCell_67))) (forall ((v_arrayElimCell_69 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_632) v_arrayElimCell_66) (bvadd (_ bv4 32) v_arrayElimCell_69))))))) (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_64 (_ BitVec 32)) (v_arrayElimCell_67 (_ BitVec 32))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_631))) (let ((.cse10 (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_632))) (or (not (= (store (select .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_632 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_632)) (= (select (select .cse10 v_arrayElimCell_64) (bvadd (_ bv4 32) v_arrayElimCell_67)) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_69 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse10 v_arrayElimCell_66) (bvadd (_ bv4 32) v_arrayElimCell_69)))))))) (or .cse5 (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_arrayElimCell_67 (_ BitVec 32))) (= (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_631) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_1) (bvadd (_ bv4 32) v_arrayElimCell_67)) |c_ULTIMATE.start_main_~data~0#1|))) (or (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_64 (_ BitVec 32)) (v_arrayElimCell_67 (_ BitVec 32))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_631))) (or (not (= (store (select .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_632 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_632)) (= (select (select (store .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_632) v_arrayElimCell_64) (bvadd (_ bv4 32) v_arrayElimCell_67)) |c_ULTIMATE.start_main_~data~0#1|)))) .cse5))) (.cse3 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|))) (and (or .cse0 .cse1) (or .cse2 .cse3) (or (forall ((v_arrayElimCell_69 (_ BitVec 32)) (v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_631))) (or (not (= (store (select .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_632 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_632)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_632) v_arrayElimCell_66) (bvadd (_ bv4 32) v_arrayElimCell_69)))))) (not .cse5)) (or (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_631) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse6))) .cse5) (or .cse2 .cse1) (or .cse0 .cse3) (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_631))) (or (not (= (store (select .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_632 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_632)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_632 .cse6)) (forall ((v_arrayElimCell_69 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_632) v_arrayElimCell_66) (bvadd (_ bv4 32) v_arrayElimCell_69))))))))))) is different from false [2023-12-16 16:21:58,766 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-16 16:21:58,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-16 16:21:58,782 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-16 16:21:58,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-16 16:21:58,928 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (= .cse9 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse1 (and (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse6 (and (or (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_64 (_ BitVec 32))) (let ((.cse14 (store |c_#memory_int#1| .cse4 v_ArrVal_631))) (or (not (= v_ArrVal_632 (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_632 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_632) v_arrayElimCell_64) .cse5))))) .cse2) (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_64 (_ BitVec 32))) (let ((.cse15 (store |c_#memory_int#1| .cse4 v_ArrVal_631))) (let ((.cse16 (store .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_632))) (or (not (= v_ArrVal_632 (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_632 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (forall ((v_arrayElimCell_69 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (= (select (select .cse16 v_arrayElimCell_66) (bvadd (_ bv4 32) v_arrayElimCell_69)) |c_ULTIMATE.start_main_~data~0#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_arrayElimCell_64) .cse5)))))))) (.cse0 (and (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_64 (_ BitVec 32)) (v_arrayElimCell_67 (_ BitVec 32))) (let ((.cse10 (store |c_#memory_int#1| .cse4 v_ArrVal_631))) (let ((.cse11 (store .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_632))) (or (not (= v_ArrVal_632 (store (select .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_632 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= (select (select .cse11 v_arrayElimCell_64) (bvadd (_ bv4 32) v_arrayElimCell_67)) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_69 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (= (select (select .cse11 v_arrayElimCell_66) (bvadd (_ bv4 32) v_arrayElimCell_69)) |c_ULTIMATE.start_main_~data~0#1|)))))) (or (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_64 (_ BitVec 32)) (v_arrayElimCell_67 (_ BitVec 32))) (let ((.cse12 (store |c_#memory_int#1| .cse4 v_ArrVal_631))) (or (not (= v_ArrVal_632 (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_632 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= (select (select (store .cse12 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_632) v_arrayElimCell_64) (bvadd (_ bv4 32) v_arrayElimCell_67)) |c_ULTIMATE.start_main_~data~0#1|)))) .cse2) (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_67 (_ BitVec 32))) (let ((.cse13 (store |c_#memory_int#1| .cse4 v_ArrVal_631))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_632 (bvadd (_ bv4 32) v_arrayElimCell_67))) (not (= v_ArrVal_632 (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_632 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (forall ((v_arrayElimCell_69 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (= (select (select (store .cse13 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_632) v_arrayElimCell_66) (bvadd (_ bv4 32) v_arrayElimCell_69)) |c_ULTIMATE.start_main_~data~0#1|))))) (or .cse2 (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_arrayElimCell_67 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| .cse4 v_ArrVal_631) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_DerPreprocessor_1) (bvadd (_ bv4 32) v_arrayElimCell_67))))))) (.cse7 (= .cse9 .cse4))) (and (or .cse0 .cse1) (or (not .cse2) (forall ((v_arrayElimCell_69 (_ BitVec 32)) (v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_int#1| .cse4 v_ArrVal_631))) (or (not (= v_ArrVal_632 (store (select .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_632 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_632) v_arrayElimCell_66) (bvadd (_ bv4 32) v_arrayElimCell_69)) |c_ULTIMATE.start_main_~data~0#1|))))) (or (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| .cse4 v_ArrVal_631) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) .cse5))) .cse2) (or .cse1 .cse6) (or .cse7 .cse6) (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int#1| .cse4 v_ArrVal_631))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_632 .cse5)) (not (= v_ArrVal_632 (store (select .cse8 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_632 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (forall ((v_arrayElimCell_69 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (= (select (select (store .cse8 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_632) v_arrayElimCell_66) (bvadd (_ bv4 32) v_arrayElimCell_69)) |c_ULTIMATE.start_main_~data~0#1|))))) (or .cse0 .cse7))))) is different from false Received shutdown request... [2023-12-16 16:22:24,639 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 16:22:24,654 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 16:22:25,067 WARN L235 SmtUtils]: Removed 157 from assertion stack [2023-12-16 16:22:25,069 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:22:25,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-16 16:22:25,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:22:25,269 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 30 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 808 for 25934ms.. [2023-12-16 16:22:25,272 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2023-12-16 16:22:25,274 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:22:25,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:22:25 BoogieIcfgContainer [2023-12-16 16:22:25,275 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:22:25,276 INFO L158 Benchmark]: Toolchain (without parser) took 77565.00ms. Allocated memory was 208.7MB in the beginning and 323.0MB in the end (delta: 114.3MB). Free memory was 139.8MB in the beginning and 123.5MB in the end (delta: 16.2MB). Peak memory consumption was 156.4MB. Max. memory is 8.0GB. [2023-12-16 16:22:25,276 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 208.7MB. Free memory is still 158.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:22:25,276 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.26ms. Allocated memory was 208.7MB in the beginning and 250.6MB in the end (delta: 41.9MB). Free memory was 139.5MB in the beginning and 204.9MB in the end (delta: -65.4MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2023-12-16 16:22:25,277 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.24ms. Allocated memory is still 250.6MB. Free memory was 204.9MB in the beginning and 202.5MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 16:22:25,277 INFO L158 Benchmark]: Boogie Preprocessor took 43.90ms. Allocated memory is still 250.6MB. Free memory was 202.5MB in the beginning and 198.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 16:22:25,277 INFO L158 Benchmark]: RCFGBuilder took 477.63ms. Allocated memory is still 250.6MB. Free memory was 198.8MB in the beginning and 176.3MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-16 16:22:25,277 INFO L158 Benchmark]: TraceAbstraction took 76585.28ms. Allocated memory was 250.6MB in the beginning and 323.0MB in the end (delta: 72.4MB). Free memory was 175.7MB in the beginning and 123.5MB in the end (delta: 52.2MB). Peak memory consumption was 149.7MB. Max. memory is 8.0GB. [2023-12-16 16:22:25,278 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.42ms. Allocated memory is still 208.7MB. Free memory is still 158.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 387.26ms. Allocated memory was 208.7MB in the beginning and 250.6MB in the end (delta: 41.9MB). Free memory was 139.5MB in the beginning and 204.9MB in the end (delta: -65.4MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.24ms. Allocated memory is still 250.6MB. Free memory was 204.9MB in the beginning and 202.5MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.90ms. Allocated memory is still 250.6MB. Free memory was 202.5MB in the beginning and 198.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 477.63ms. Allocated memory is still 250.6MB. Free memory was 198.8MB in the beginning and 176.3MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 76585.28ms. Allocated memory was 250.6MB in the beginning and 323.0MB in the end (delta: 72.4MB). Free memory was 175.7MB in the beginning and 123.5MB in the end (delta: 52.2MB). Peak memory consumption was 149.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 647). Cancelled while NwaCegarLoop was analyzing trace of length 30 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 808 for 25934ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 76.5s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 26.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 161 SdHoareTripleChecker+Valid, 25.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 950 SdHoareTripleChecker+Invalid, 24.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 790 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1144 IncrementalHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 160 mSDtfsCounter, 1144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 336 GetRequests, 215 SyntacticMatches, 2 SemanticMatches, 119 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=4, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 20 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 270 ConstructedInterpolants, 29 QuantifiedInterpolants, 2151 SizeOfPredicates, 100 NumberOfNonLiveVariables, 1866 ConjunctsInSsa, 208 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 82/108 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown