/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-properties/list_search-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:13:59,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:13:59,390 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:13:59,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:13:59,396 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:13:59,423 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:13:59,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:13:59,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:13:59,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:13:59,424 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:13:59,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:13:59,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:13:59,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:13:59,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:13:59,425 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:13:59,425 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:13:59,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:13:59,426 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:13:59,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:13:59,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:13:59,427 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:13:59,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:13:59,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:13:59,430 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:13:59,433 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:13:59,433 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:13:59,433 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:13:59,433 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:13:59,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:13:59,433 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:13:59,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:13:59,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:13:59,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:13:59,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:13:59,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:13:59,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:13:59,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:13:59,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:13:59,435 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:13:59,435 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:13:59,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:13:59,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:13:59,436 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:13:59,436 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:13:59,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:13:59,436 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:13:59,436 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:13:59,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:13:59,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:13:59,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:13:59,639 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:13:59,640 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:13:59,641 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_search-1.i [2023-12-16 16:14:00,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:14:00,894 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:14:00,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_search-1.i [2023-12-16 16:14:00,907 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed6e21e4d/8cf16977875b43a3ad52ed6ca5889de2/FLAGc089b082c [2023-12-16 16:14:00,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed6e21e4d/8cf16977875b43a3ad52ed6ca5889de2 [2023-12-16 16:14:00,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:14:00,920 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:14:00,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:14:00,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:14:00,926 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:14:00,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:14:00" (1/1) ... [2023-12-16 16:14:00,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16abdab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:00, skipping insertion in model container [2023-12-16 16:14:00,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:14:00" (1/1) ... [2023-12-16 16:14:00,968 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:14:01,092 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-properties/list_search-1.i[813,826] [2023-12-16 16:14:01,168 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:14:01,177 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-16 16:14:01,180 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:14:01,183 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-properties/list_search-1.i[813,826] [2023-12-16 16:14:01,202 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:14:01,205 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:14:01,214 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-properties/list_search-1.i[813,826] [2023-12-16 16:14:01,228 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:14:01,247 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:14:01,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:01 WrapperNode [2023-12-16 16:14:01,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:14:01,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:14:01,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:14:01,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:14:01,253 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:14:01" (1/1) ... [2023-12-16 16:14:01,264 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:14:01" (1/1) ... [2023-12-16 16:14:01,278 INFO L138 Inliner]: procedures = 128, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2023-12-16 16:14:01,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:14:01,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:14:01,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:14:01,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:14:01,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:01" (1/1) ... [2023-12-16 16:14:01,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:01" (1/1) ... [2023-12-16 16:14:01,298 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:01" (1/1) ... [2023-12-16 16:14:01,325 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2023-12-16 16:14:01,325 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:01" (1/1) ... [2023-12-16 16:14:01,325 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:01" (1/1) ... [2023-12-16 16:14:01,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:01" (1/1) ... [2023-12-16 16:14:01,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:01" (1/1) ... [2023-12-16 16:14:01,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:01" (1/1) ... [2023-12-16 16:14:01,343 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:01" (1/1) ... [2023-12-16 16:14:01,351 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:14:01,352 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:14:01,352 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:14:01,352 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:14:01,353 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:01" (1/1) ... [2023-12-16 16:14:01,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:14:01,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:14:01,380 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:14:01,399 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:14:01,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 16:14:01,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 16:14:01,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 16:14:01,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:14:01,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-16 16:14:01,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-16 16:14:01,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-16 16:14:01,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-16 16:14:01,407 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2023-12-16 16:14:01,407 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2023-12-16 16:14:01,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 16:14:01,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 16:14:01,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 16:14:01,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:14:01,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 16:14:01,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:14:01,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:14:01,528 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:14:01,529 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:14:01,721 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:14:01,750 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:14:01,750 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 16:14:01,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:14:01 BoogieIcfgContainer [2023-12-16 16:14:01,750 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:14:01,752 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:14:01,752 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:14:01,754 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:14:01,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:14:00" (1/3) ... [2023-12-16 16:14:01,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ed764f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:14:01, skipping insertion in model container [2023-12-16 16:14:01,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:01" (2/3) ... [2023-12-16 16:14:01,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ed764f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:14:01, skipping insertion in model container [2023-12-16 16:14:01,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:14:01" (3/3) ... [2023-12-16 16:14:01,756 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2023-12-16 16:14:01,769 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:14:01,769 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:14:01,799 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:14:01,804 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;@b5004f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:14:01,804 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:14:01,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 16:14:01,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 16:14:01,813 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:14:01,814 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:14:01,814 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:14:01,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:14:01,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1970383394, now seen corresponding path program 1 times [2023-12-16 16:14:01,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:14:01,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685495653] [2023-12-16 16:14:01,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:14:01,828 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:14:01,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:14:01,830 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:14:01,857 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:14:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:14:02,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 16:14:02,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:14:02,129 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-16 16:14:02,129 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:14:02,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:14:02,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685495653] [2023-12-16 16:14:02,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685495653] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:14:02,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:14:02,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:14:02,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699920840] [2023-12-16 16:14:02,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:14:02,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 16:14:02,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:14:02,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 16:14:02,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:14:02,164 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-16 16:14:02,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:14:02,187 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2023-12-16 16:14:02,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 16:14:02,189 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2023-12-16 16:14:02,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:14:02,194 INFO L225 Difference]: With dead ends: 32 [2023-12-16 16:14:02,194 INFO L226 Difference]: Without dead ends: 20 [2023-12-16 16:14:02,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 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:14:02,199 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:14:02,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:14:02,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-16 16:14:02,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-16 16:14:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 16:14:02,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-12-16 16:14:02,231 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 29 [2023-12-16 16:14:02,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:14:02,233 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-12-16 16:14:02,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-16 16:14:02,234 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-12-16 16:14:02,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-16 16:14:02,236 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:14:02,236 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:14:02,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 16:14:02,440 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:14:02,441 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:14:02,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:14:02,442 INFO L85 PathProgramCache]: Analyzing trace with hash -961709975, now seen corresponding path program 1 times [2023-12-16 16:14:02,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:14:02,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646345069] [2023-12-16 16:14:02,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:14:02,444 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:14:02,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:14:02,445 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:14:02,454 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:14:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:14:02,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:14:02,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:14:02,643 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 16:14:02,644 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:14:02,740 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-16 16:14:02,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:14:02,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646345069] [2023-12-16 16:14:02,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1646345069] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:14:02,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:14:02,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-12-16 16:14:02,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812868949] [2023-12-16 16:14:02,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:14:02,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 16:14:02,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:14:02,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 16:14:02,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:14:02,747 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-16 16:14:02,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:14:02,932 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2023-12-16 16:14:02,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 16:14:02,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 31 [2023-12-16 16:14:02,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:14:02,935 INFO L225 Difference]: With dead ends: 41 [2023-12-16 16:14:02,935 INFO L226 Difference]: Without dead ends: 25 [2023-12-16 16:14:02,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-12-16 16:14:02,936 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:14:02,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 66 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:14:02,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-16 16:14:02,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2023-12-16 16:14:02,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-16 16:14:02,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-12-16 16:14:02,941 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 31 [2023-12-16 16:14:02,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:14:02,941 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-12-16 16:14:02,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-16 16:14:02,942 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-12-16 16:14:02,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-16 16:14:02,942 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:14:02,942 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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:14:02,947 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:14:03,143 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:14:03,144 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:14:03,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:14:03,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2138016675, now seen corresponding path program 1 times [2023-12-16 16:14:03,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:14:03,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665124624] [2023-12-16 16:14:03,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:14:03,145 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:14:03,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:14:03,147 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:14:03,155 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:14:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:14:03,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 16:14:03,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:14:03,472 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 51 treesize of output 19 [2023-12-16 16:14:03,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:03,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 32 [2023-12-16 16:14:03,647 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 16:14:03,648 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:14:03,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:14:03,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665124624] [2023-12-16 16:14:03,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665124624] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:14:03,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:14:03,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 16:14:03,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507571186] [2023-12-16 16:14:03,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:14:03,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 16:14:03,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:14:03,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 16:14:03,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:14:03,650 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-16 16:14:03,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:14:03,955 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2023-12-16 16:14:03,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 16:14:03,956 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2023-12-16 16:14:03,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:14:03,957 INFO L225 Difference]: With dead ends: 33 [2023-12-16 16:14:03,957 INFO L226 Difference]: Without dead ends: 29 [2023-12-16 16:14:03,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:14:03,958 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 23 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:14:03,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 61 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:14:03,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-16 16:14:03,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-12-16 16:14:03,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-16 16:14:03,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-12-16 16:14:03,963 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 31 [2023-12-16 16:14:03,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:14:03,963 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-12-16 16:14:03,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-16 16:14:03,964 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-12-16 16:14:03,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-16 16:14:03,964 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:14:03,964 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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:14:03,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 16:14:04,176 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:14:04,177 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:14:04,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:14:04,177 INFO L85 PathProgramCache]: Analyzing trace with hash 2139863717, now seen corresponding path program 1 times [2023-12-16 16:14:04,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:14:04,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597331176] [2023-12-16 16:14:04,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:14:04,180 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:14:04,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:14:04,181 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:14:04,183 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:14:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:14:04,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:14:04,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:14:04,386 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 16:14:04,387 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:14:04,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:14:04,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597331176] [2023-12-16 16:14:04,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1597331176] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:14:04,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:14:04,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 16:14:04,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468486553] [2023-12-16 16:14:04,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:14:04,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:14:04,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:14:04,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:14:04,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:14:04,389 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-16 16:14:04,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:14:04,565 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2023-12-16 16:14:04,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 16:14:04,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2023-12-16 16:14:04,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:14:04,567 INFO L225 Difference]: With dead ends: 35 [2023-12-16 16:14:04,567 INFO L226 Difference]: Without dead ends: 28 [2023-12-16 16:14:04,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:14:04,567 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:14:04,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 66 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:14:04,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-16 16:14:04,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2023-12-16 16:14:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-16 16:14:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2023-12-16 16:14:04,572 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 31 [2023-12-16 16:14:04,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:14:04,573 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2023-12-16 16:14:04,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-16 16:14:04,573 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2023-12-16 16:14:04,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-16 16:14:04,573 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:14:04,574 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:14:04,579 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 (5)] Ended with exit code 0 [2023-12-16 16:14:04,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:14:04,776 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:14:04,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:14:04,777 INFO L85 PathProgramCache]: Analyzing trace with hash -497212319, now seen corresponding path program 1 times [2023-12-16 16:14:04,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:14:04,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858376472] [2023-12-16 16:14:04,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:14:04,777 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:14:04,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:14:04,778 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:14:04,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 16:14:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:14:05,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-16 16:14:05,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:14:05,117 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:14:05,132 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 51 treesize of output 19 [2023-12-16 16:14:05,294 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:14:05,303 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:14:05,382 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-16 16:14:05,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-12-16 16:14:05,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2023-12-16 16:14:05,417 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-12-16 16:14:05,417 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:14:05,569 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 48 treesize of output 32 [2023-12-16 16:14:05,572 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 32 treesize of output 20 [2023-12-16 16:14:05,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:05,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 32 [2023-12-16 16:14:05,648 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-16 16:14:05,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:14:06,000 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_45 (_ BitVec 32)) (v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 8)))) (or (not (= (select |c_#valid| v_~head~0.base_45) (_ bv0 1))) (not (= (let ((.cse0 (select (store |c_#memory_int#1| v_~head~0.base_45 v_ArrVal_605) c_~head~0.base))) (concat (concat (concat (select .cse0 (bvadd c_~head~0.offset (_ bv3 32))) (select .cse0 (bvadd c_~head~0.offset (_ bv2 32)))) (select .cse0 (bvadd c_~head~0.offset (_ bv1 32)))) (select .cse0 c_~head~0.offset))) (_ bv2 32))))) is different from false [2023-12-16 16:14:06,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:14:06,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858376472] [2023-12-16 16:14:06,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858376472] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 16:14:06,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2124269905] [2023-12-16 16:14:06,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:14:06,003 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 16:14:06,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 16:14:06,004 INFO L229 MonitoredProcess]: Starting monitored process 7 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:14:06,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-16 16:14:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:14:06,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-16 16:14:06,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:14:06,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-16 16:14:06,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2023-12-16 16:14:06,792 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:14:06,796 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:14:06,846 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-12-16 16:14:06,847 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:14:06,852 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 53 treesize of output 30 [2023-12-16 16:14:07,027 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 60 treesize of output 36 [2023-12-16 16:14:07,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-16 16:14:07,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:07,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 13 [2023-12-16 16:14:07,146 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-16 16:14:07,146 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:14:07,381 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_757 (Array (_ BitVec 32) (_ BitVec 8))) (v_~head~0.base_51 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~head~0.base_51))) (not (= (let ((.cse0 (select (store |c_#memory_int#1| v_~head~0.base_51 v_ArrVal_757) c_~head~0.base))) (concat (concat (concat (select .cse0 (bvadd c_~head~0.offset (_ bv3 32))) (select .cse0 (bvadd c_~head~0.offset (_ bv2 32)))) (select .cse0 (bvadd c_~head~0.offset (_ bv1 32)))) (select .cse0 c_~head~0.offset))) (_ bv2 32))))) is different from false [2023-12-16 16:14:07,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2124269905] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 16:14:07,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:14:07,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2023-12-16 16:14:07,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234309951] [2023-12-16 16:14:07,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:14:07,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-16 16:14:07,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:14:07,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-16 16:14:07,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=541, Unknown=2, NotChecked=94, Total=702 [2023-12-16 16:14:07,384 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 22 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-16 16:14:09,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:14:09,151 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2023-12-16 16:14:09,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 16:14:09,155 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 34 [2023-12-16 16:14:09,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:14:09,155 INFO L225 Difference]: With dead ends: 39 [2023-12-16 16:14:09,155 INFO L226 Difference]: Without dead ends: 35 [2023-12-16 16:14:09,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=146, Invalid=982, Unknown=2, NotChecked=130, Total=1260 [2023-12-16 16:14:09,156 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 47 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:14:09,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 154 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-16 16:14:09,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-16 16:14:09,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2023-12-16 16:14:09,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-16 16:14:09,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-12-16 16:14:09,162 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 34 [2023-12-16 16:14:09,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:14:09,162 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-12-16 16:14:09,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-16 16:14:09,162 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-12-16 16:14:09,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-16 16:14:09,163 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:14:09,163 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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:14:09,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2023-12-16 16:14:09,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 16:14:09,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:14:09,578 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:14:09,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:14:09,579 INFO L85 PathProgramCache]: Analyzing trace with hash -495365277, now seen corresponding path program 1 times [2023-12-16 16:14:09,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:14:09,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451802570] [2023-12-16 16:14:09,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:14:09,579 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:14:09,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:14:09,580 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:14:09,614 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:14:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:14:09,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-16 16:14:09,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:14:09,807 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:14:09,903 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:14:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-16 16:14:09,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:14:10,116 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-16 16:14:10,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:14:10,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451802570] [2023-12-16 16:14:10,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451802570] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:14:10,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:14:10,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2023-12-16 16:14:10,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905371247] [2023-12-16 16:14:10,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:14:10,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-16 16:14:10,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:14:10,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-16 16:14:10,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2023-12-16 16:14:10,120 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 16:14:10,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:14:10,978 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2023-12-16 16:14:10,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 16:14:10,979 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2023-12-16 16:14:10,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:14:10,980 INFO L225 Difference]: With dead ends: 42 [2023-12-16 16:14:10,980 INFO L226 Difference]: Without dead ends: 35 [2023-12-16 16:14:10,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2023-12-16 16:14:10,981 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 84 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 16:14:10,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 92 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 16:14:10,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-16 16:14:10,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2023-12-16 16:14:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 16:14:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-12-16 16:14:10,986 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 34 [2023-12-16 16:14:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:14:10,986 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-12-16 16:14:10,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 16:14:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-12-16 16:14:10,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-16 16:14:10,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:14:10,987 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:14:10,994 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:14:11,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:14:11,194 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:14:11,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:14:11,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1103031011, now seen corresponding path program 2 times [2023-12-16 16:14:11,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:14:11,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24563989] [2023-12-16 16:14:11,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:14:11,195 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:14:11,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:14:11,196 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:14:11,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 16:14:11,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:14:11,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:14:11,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 72 conjunts are in the unsatisfiable core [2023-12-16 16:14:11,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:14:11,654 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:14:11,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2023-12-16 16:14:11,806 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:14:11,816 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:14:11,910 INFO L349 Elim1Store]: treesize reduction 34, result has 37.0 percent of original size [2023-12-16 16:14:11,910 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 23 treesize of output 35 [2023-12-16 16:14:11,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2023-12-16 16:14:12,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-16 16:14:12,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 46 [2023-12-16 16:14:12,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-16 16:14:12,461 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-16 16:14:12,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-12-16 16:14:12,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:14:12,482 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 70 treesize of output 47 [2023-12-16 16:14:12,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:14:12,494 INFO L349 Elim1Store]: treesize reduction 6, result has 66.7 percent of original size [2023-12-16 16:14:12,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 26 [2023-12-16 16:14:12,503 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 39 treesize of output 24 [2023-12-16 16:14:12,972 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-16 16:14:12,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2023-12-16 16:14:12,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-16 16:14:13,078 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-12-16 16:14:13,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 70 treesize of output 42 [2023-12-16 16:14:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 16:14:13,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:14:13,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:13,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 123 [2023-12-16 16:14:13,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:13,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 123 [2023-12-16 16:14:14,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:14,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 16:14:14,074 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 8))) (v_~head~0.base_75 (_ BitVec 32)) (v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_4 (_ bv4 32)) c_~head~0.base)) (not (= (_ bv2 32) (let ((.cse2 (bvadd c_~head~0.offset (_ bv4 32)))) (let ((.cse0 (select (store |c_#memory_int#1| v_~head~0.base_75 v_DerPreprocessor_7) (select (select (store |c_#memory_$Pointer$#1.base| v_~head~0.base_75 v_arrayElimArr_4) c_~head~0.base) .cse2))) (.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| v_~head~0.base_75 v_arrayElimArr_5) c_~head~0.base) .cse2))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) .cse1)) (select .cse0 (bvadd (_ bv2 32) .cse1))) (select .cse0 (bvadd (_ bv1 32) .cse1))) (select .cse0 .cse1)))))) (not (= (_ bv3 8) (select v_DerPreprocessor_7 (_ bv0 32)))) (not (= (select |c_#valid| v_~head~0.base_75) (_ bv0 1))) (not (= (select v_DerPreprocessor_7 (_ bv2 32)) (_ bv0 8))) (not (= c_~head~0.offset (select v_arrayElimArr_5 (_ bv4 32)))))) is different from false [2023-12-16 16:14:14,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:14:14,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24563989] [2023-12-16 16:14:14,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24563989] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 16:14:14,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [200101087] [2023-12-16 16:14:14,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:14:14,078 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 16:14:14,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 16:14:14,079 INFO L229 MonitoredProcess]: Starting monitored process 10 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:14:14,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-16 16:14:14,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:14:14,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:14:14,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 88 conjunts are in the unsatisfiable core [2023-12-16 16:14:14,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:14:14,664 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:14:14,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2023-12-16 16:14:14,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 43 [2023-12-16 16:14:15,014 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:14:15,025 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:14:15,240 INFO L349 Elim1Store]: treesize reduction 34, result has 37.0 percent of original size [2023-12-16 16:14:15,241 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 23 treesize of output 35 [2023-12-16 16:14:15,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 30 [2023-12-16 16:14:15,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 40 [2023-12-16 16:14:15,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-16 16:14:15,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-16 16:14:15,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:14:15,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 55 [2023-12-16 16:14:15,824 INFO L349 Elim1Store]: treesize reduction 76, result has 31.5 percent of original size [2023-12-16 16:14:15,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 70 [2023-12-16 16:14:15,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:14:15,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:14:15,858 INFO L349 Elim1Store]: treesize reduction 6, result has 66.7 percent of original size [2023-12-16 16:14:15,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 26 [2023-12-16 16:14:15,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:14:15,890 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:14:16,655 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 16:14:16,655 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 63 [2023-12-16 16:14:16,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 16:14:16,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-16 16:14:16,860 INFO L349 Elim1Store]: treesize reduction 68, result has 16.0 percent of original size [2023-12-16 16:14:16,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 6 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 78 treesize of output 46 [2023-12-16 16:14:16,909 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 16:14:16,909 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:14:17,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:17,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 123 [2023-12-16 16:14:17,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:17,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 123 [2023-12-16 16:14:17,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:17,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2023-12-16 16:14:17,516 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 8))) (v_~head~0.base_81 (_ BitVec 32)) (v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_DerPreprocessor_12 (_ bv2 32)) (_ bv0 8))) (not (= (let ((.cse2 (bvadd c_~head~0.offset (_ bv4 32)))) (let ((.cse0 (select (store |c_#memory_int#1| v_~head~0.base_81 v_DerPreprocessor_12) (select (select (store |c_#memory_$Pointer$#1.base| v_~head~0.base_81 v_arrayElimArr_10) c_~head~0.base) .cse2))) (.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| v_~head~0.base_81 v_arrayElimArr_11) c_~head~0.base) .cse2))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) .cse1)) (select .cse0 (bvadd (_ bv2 32) .cse1))) (select .cse0 (bvadd .cse1 (_ bv1 32)))) (select .cse0 .cse1)))) (_ bv2 32))) (not (= (select v_DerPreprocessor_12 (_ bv0 32)) (_ bv3 8))) (not (= (_ bv0 8) (select v_DerPreprocessor_12 (_ bv1 32)))) (not (= c_~head~0.offset (select v_arrayElimArr_11 (_ bv4 32)))) (not (= (select v_DerPreprocessor_12 (_ bv3 32)) (_ bv0 8))) (not (= c_~head~0.base (select v_arrayElimArr_10 (_ bv4 32)))) (not (= (select |c_#valid| v_~head~0.base_81) (_ bv0 1))))) is different from false [2023-12-16 16:14:17,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [200101087] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 16:14:17,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:14:17,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 34 [2023-12-16 16:14:17,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43267572] [2023-12-16 16:14:17,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:14:17,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-16 16:14:17,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:14:17,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-16 16:14:17,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1305, Unknown=2, NotChecked=146, Total=1560 [2023-12-16 16:14:17,522 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 34 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 30 states have internal predecessors, (48), 5 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-16 16:14:25,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-16 16:14:30,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:14:30,352 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2023-12-16 16:14:30,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 16:14:30,353 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 30 states have internal predecessors, (48), 5 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 37 [2023-12-16 16:14:30,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:14:30,353 INFO L225 Difference]: With dead ends: 44 [2023-12-16 16:14:30,354 INFO L226 Difference]: Without dead ends: 40 [2023-12-16 16:14:30,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=257, Invalid=2401, Unknown=2, NotChecked=202, Total=2862 [2023-12-16 16:14:30,355 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:14:30,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 212 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2023-12-16 16:14:30,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-16 16:14:30,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2023-12-16 16:14:30,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 16:14:30,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2023-12-16 16:14:30,361 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 37 [2023-12-16 16:14:30,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:14:30,361 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2023-12-16 16:14:30,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 30 states have internal predecessors, (48), 5 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-16 16:14:30,362 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2023-12-16 16:14:30,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-16 16:14:30,362 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:14:30,362 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:14:30,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-16 16:14:30,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2023-12-16 16:14:30,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 16:14:30,764 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:14:30,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:14:30,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1104878053, now seen corresponding path program 2 times [2023-12-16 16:14:30,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:14:30,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011570024] [2023-12-16 16:14:30,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:14:30,765 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:14:30,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:14:30,765 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:14:30,798 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:14:31,083 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:14:31,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:14:31,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-16 16:14:31,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:14:31,120 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:14:31,137 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:14:31,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-16 16:14:31,278 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:14:31,361 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-12-16 16:14:31,361 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:14:31,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-12-16 16:14:31,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-16 16:14:31,519 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 16:14:31,519 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2023-12-16 16:14:31,556 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 16:14:31,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:14:31,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:31,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2023-12-16 16:14:31,878 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_87 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_13 (_ bv4 32)) c_~head~0.base)) (not (= (select |c_#valid| v_~head~0.base_87) (_ bv0 1))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| v_~head~0.base_87 v_arrayElimArr_13) c_~head~0.base) (bvadd c_~head~0.offset (_ bv4 32))) (_ bv0 32))))) is different from false [2023-12-16 16:14:31,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:14:31,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011570024] [2023-12-16 16:14:31,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011570024] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 16:14:31,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [938139715] [2023-12-16 16:14:31,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:14:31,880 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 16:14:31,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 16:14:31,881 INFO L229 MonitoredProcess]: Starting monitored process 12 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:14:31,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2023-12-16 16:14:32,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:14:32,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:14:32,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-16 16:14:32,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:14:32,338 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:14:32,349 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:14:32,401 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:14:32,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-16 16:14:32,441 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-12-16 16:14:32,441 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:14:32,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-12-16 16:14:32,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-16 16:14:32,538 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 16:14:32,539 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2023-12-16 16:14:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 16:14:32,543 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:14:32,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:32,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2023-12-16 16:14:32,793 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_15 (Array (_ BitVec 32) (_ BitVec 32))) (v_~head~0.base_93 (_ BitVec 32))) (or (not (= c_~head~0.base (select v_arrayElimArr_15 (_ bv4 32)))) (not (= (select |c_#valid| v_~head~0.base_93) (_ bv0 1))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| v_~head~0.base_93 v_arrayElimArr_15) c_~head~0.base) (bvadd c_~head~0.offset (_ bv4 32))) (_ bv0 32))))) is different from false [2023-12-16 16:14:32,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [938139715] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 16:14:32,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:14:32,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2023-12-16 16:14:32,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771685847] [2023-12-16 16:14:32,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:14:32,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 16:14:32,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:14:32,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 16:14:32,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=377, Unknown=2, NotChecked=78, Total=506 [2023-12-16 16:14:32,797 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 18 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-16 16:14:35,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:14:35,468 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2023-12-16 16:14:35,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 16:14:35,469 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2023-12-16 16:14:35,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:14:35,469 INFO L225 Difference]: With dead ends: 45 [2023-12-16 16:14:35,469 INFO L226 Difference]: Without dead ends: 38 [2023-12-16 16:14:35,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=238, Invalid=1328, Unknown=2, NotChecked=154, Total=1722 [2023-12-16 16:14:35,470 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 71 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-16 16:14:35,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 119 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-16 16:14:35,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-16 16:14:35,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2023-12-16 16:14:35,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 16:14:35,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2023-12-16 16:14:35,477 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 37 [2023-12-16 16:14:35,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:14:35,477 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2023-12-16 16:14:35,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-16 16:14:35,477 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2023-12-16 16:14:35,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 16:14:35,478 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:14:35,478 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:14:35,487 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 (11)] Ended with exit code 0 [2023-12-16 16:14:35,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2023-12-16 16:14:35,885 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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 16:14:35,885 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:14:35,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:14:35,885 INFO L85 PathProgramCache]: Analyzing trace with hash -184910559, now seen corresponding path program 3 times [2023-12-16 16:14:35,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:14:35,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504539803] [2023-12-16 16:14:35,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 16:14:35,886 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:14:35,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:14:35,887 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:14:35,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-16 16:14:36,744 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-16 16:14:36,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-16 16:14:36,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 16:14:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 16:14:37,164 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 16:14:37,164 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 16:14:37,165 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:14:37,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-16 16:14:37,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:14:37,369 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2023-12-16 16:14:37,378 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:14:37,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:14:37 BoogieIcfgContainer [2023-12-16 16:14:37,428 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:14:37,429 INFO L158 Benchmark]: Toolchain (without parser) took 36508.41ms. Allocated memory was 197.1MB in the beginning and 390.1MB in the end (delta: 192.9MB). Free memory was 151.5MB in the beginning and 212.2MB in the end (delta: -60.6MB). Peak memory consumption was 133.3MB. Max. memory is 8.0GB. [2023-12-16 16:14:37,429 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 197.1MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:14:37,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.44ms. Allocated memory is still 197.1MB. Free memory was 151.0MB in the beginning and 128.6MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-16 16:14:37,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.34ms. Allocated memory is still 197.1MB. Free memory was 128.6MB in the beginning and 126.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:14:37,432 INFO L158 Benchmark]: Boogie Preprocessor took 72.78ms. Allocated memory is still 197.1MB. Free memory was 126.5MB in the beginning and 123.8MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 16:14:37,432 INFO L158 Benchmark]: RCFGBuilder took 398.26ms. Allocated memory is still 197.1MB. Free memory was 123.8MB in the beginning and 107.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-16 16:14:37,432 INFO L158 Benchmark]: TraceAbstraction took 35676.67ms. Allocated memory was 197.1MB in the beginning and 390.1MB in the end (delta: 192.9MB). Free memory was 106.5MB in the beginning and 212.2MB in the end (delta: -105.6MB). Peak memory consumption was 88.2MB. Max. memory is 8.0GB. [2023-12-16 16:14:37,433 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.44ms. Allocated memory is still 197.1MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 325.44ms. Allocated memory is still 197.1MB. Free memory was 151.0MB in the beginning and 128.6MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.34ms. Allocated memory is still 197.1MB. Free memory was 128.6MB in the beginning and 126.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 72.78ms. Allocated memory is still 197.1MB. Free memory was 126.5MB in the beginning and 123.8MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 398.26ms. Allocated memory is still 197.1MB. Free memory was 123.8MB in the beginning and 107.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 35676.67ms. Allocated memory was 197.1MB in the beginning and 390.1MB in the end (delta: 192.9MB). Free memory was 106.5MB in the beginning and 212.2MB in the end (delta: -105.6MB). Peak memory consumption was 88.2MB. 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 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L533] mlist *head; [L554] int i; [L555] mlist *mylist, *temp; VAL [head={0:0}] [L556] CALL insert_list(mylist,2) VAL [\old(head)={0:0}, \old(k)=2, head={0:0}, l={6:7}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)={0:0}, \old(k)=2, head={0:0}, k=2, l={-2147483646:0}, l={6:7}] [L544] COND TRUE head==((void *)0) [L545] l->next = ((void *)0) VAL [\old(head)={0:0}, \old(k)=2, head={0:0}, k=2, l={-2147483646:0}, l={6:7}] [L550] head = l [L551] return 0; [L556] RET insert_list(mylist,2) VAL [head={-2147483646:0}, mylist={6:7}] [L557] CALL insert_list(mylist,5) VAL [\old(head)={-2147483646:0}, \old(k)=5, head={-2147483646:0}, l={6:7}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)={-2147483646:0}, \old(k)=5, head={-2147483646:0}, k=5, l={3:0}, l={6:7}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(head)={-2147483646:0}, \old(k)=5, head={-2147483646:0}, k=5, l={3:0}, l={6:7}] [L550] head = l [L551] return 0; [L557] RET insert_list(mylist,5) VAL [head={3:0}, mylist={6:7}] [L558] CALL insert_list(mylist,1) VAL [\old(head)={3:0}, \old(k)=1, head={3:0}, l={6:7}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)={3:0}, \old(k)=1, head={3:0}, k=1, l={1073741825:0}, l={6:7}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(head)={3:0}, \old(k)=1, head={3:0}, k=1, l={1073741825:0}, l={6:7}] [L550] head = l [L551] return 0; [L558] RET insert_list(mylist,1) VAL [head={1073741825:0}, mylist={6:7}] [L559] CALL insert_list(mylist,3) VAL [\old(head)={1073741825:0}, \old(k)=3, head={1073741825:0}, l={6:7}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)={1073741825:0}, \old(k)=3, head={1073741825:0}, k=3, l={-2147483647:0}, l={6:7}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(head)={1073741825:0}, \old(k)=3, head={1073741825:0}, k=3, l={-2147483647:0}, l={6:7}] [L550] head = l [L551] return 0; [L559] RET insert_list(mylist,3) VAL [head={-2147483647:0}, mylist={6:7}] [L560] CALL, EXPR search_list(head,2) [L535] l = head VAL [\old(k)=2, head={-2147483647:0}, k=2, l={-2147483647:0}, l={-2147483647:0}] [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-2147483647:0}, k=2, l={-2147483647:0}, l={-2147483647:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-2147483647:0}, k=2, l={-2147483647:0}, l={-2147483647:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-2147483647:0}, k=2, l={-2147483647:0}, l={1073741825:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-2147483647:0}, k=2, l={-2147483647:0}, l={1073741825:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-2147483647:0}, k=2, l={-2147483647:0}, l={3:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-2147483647:0}, k=2, l={-2147483647:0}, l={3:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-2147483647:0}, k=2, l={-2147483646:0}, l={-2147483647:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-2147483647:0}, k=2, l={-2147483646:0}, l={-2147483647:0}] [L536] COND FALSE !(l!=((void *)0) && l->key!=k) [L539] return l; [L560] RET, EXPR search_list(head,2) [L560] temp = search_list(head,2) [L561] EXPR temp->key [L561] CALL __VERIFIER_assert(temp->key==1) [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, head={-2147483647:0}] [L15] reach_error() VAL [\old(cond)=0, cond=0, head={-2147483647:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.6s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 314 SdHoareTripleChecker+Valid, 15.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 314 mSDsluCounter, 796 SdHoareTripleChecker+Invalid, 14.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 673 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1671 IncrementalHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 123 mSDtfsCounter, 1671 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 579 GetRequests, 393 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=7, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 26 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 424 ConstructedInterpolants, 16 QuantifiedInterpolants, 5774 SizeOfPredicates, 130 NumberOfNonLiveVariables, 3462 ConjunctsInSsa, 356 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 247/360 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 proved your program to be incorrect! [2023-12-16 16:14:37,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...