/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/dll2c_update_all.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 21:28:40,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 21:28:40,524 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 21:28:40,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 21:28:40,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 21:28:40,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 21:28:40,550 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 21:28:40,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 21:28:40,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 21:28:40,553 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 21:28:40,553 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 21:28:40,553 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 21:28:40,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 21:28:40,554 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 21:28:40,554 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 21:28:40,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 21:28:40,554 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 21:28:40,554 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 21:28:40,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 21:28:40,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 21:28:40,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 21:28:40,555 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 21:28:40,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 21:28:40,556 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 21:28:40,556 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 21:28:40,556 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 21:28:40,556 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 21:28:40,556 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 21:28:40,556 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 21:28:40,557 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 21:28:40,557 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 21:28:40,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 21:28:40,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 21:28:40,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 21:28:40,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:28:40,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 21:28:40,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 21:28:40,558 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 21:28:40,558 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 21:28:40,558 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 21:28:40,558 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 21:28:40,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 21:28:40,559 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 21:28:40,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 21:28:40,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 21:28:40,559 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 21:28:40,559 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 21:28:40,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 21:28:40,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 21:28:40,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 21:28:40,750 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 21:28:40,754 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 21:28:40,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_update_all.i [2023-12-24 21:28:41,704 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 21:28:41,897 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 21:28:41,898 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all.i [2023-12-24 21:28:41,906 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06ab697de/2e13ed70313a41259db91b2f49993626/FLAGfdd687471 [2023-12-24 21:28:41,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06ab697de/2e13ed70313a41259db91b2f49993626 [2023-12-24 21:28:41,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 21:28:41,919 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 21:28:41,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 21:28:41,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 21:28:41,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 21:28:41,924 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:28:41" (1/1) ... [2023-12-24 21:28:41,925 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30b8af56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:28:41, skipping insertion in model container [2023-12-24 21:28:41,925 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:28:41" (1/1) ... [2023-12-24 21:28:41,958 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:28:42,207 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all.i[24538,24551] [2023-12-24 21:28:42,213 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:28:42,232 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 21:28:42,267 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all.i[24538,24551] [2023-12-24 21:28:42,275 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:28:42,299 INFO L206 MainTranslator]: Completed translation [2023-12-24 21:28:42,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:28:42 WrapperNode [2023-12-24 21:28:42,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 21:28:42,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 21:28:42,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 21:28:42,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 21:28:42,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:28:42" (1/1) ... [2023-12-24 21:28:42,332 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:28:42" (1/1) ... [2023-12-24 21:28:42,350 INFO L138 Inliner]: procedures = 129, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 136 [2023-12-24 21:28:42,351 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 21:28:42,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 21:28:42,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 21:28:42,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 21:28:42,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:28:42" (1/1) ... [2023-12-24 21:28:42,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:28:42" (1/1) ... [2023-12-24 21:28:42,361 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:28:42" (1/1) ... [2023-12-24 21:28:42,383 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 8 writes are split as follows [0, 8]. [2023-12-24 21:28:42,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:28:42" (1/1) ... [2023-12-24 21:28:42,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:28:42" (1/1) ... [2023-12-24 21:28:42,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:28:42" (1/1) ... [2023-12-24 21:28:42,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:28:42" (1/1) ... [2023-12-24 21:28:42,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:28:42" (1/1) ... [2023-12-24 21:28:42,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:28:42" (1/1) ... [2023-12-24 21:28:42,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 21:28:42,405 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 21:28:42,405 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 21:28:42,405 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 21:28:42,406 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:28:42" (1/1) ... [2023-12-24 21:28:42,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:28:42,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 21:28:42,431 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 21:28:42,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 21:28:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 21:28:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 21:28:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-24 21:28:42,449 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-24 21:28:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 21:28:42,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 21:28:42,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 21:28:42,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 21:28:42,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 21:28:42,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 21:28:42,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 21:28:42,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 21:28:42,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 21:28:42,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 21:28:42,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 21:28:42,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 21:28:42,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 21:28:42,537 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 21:28:42,539 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 21:28:42,788 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 21:28:42,813 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 21:28:42,813 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-24 21:28:42,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:28:42 BoogieIcfgContainer [2023-12-24 21:28:42,819 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 21:28:42,821 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 21:28:42,821 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 21:28:42,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 21:28:42,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:28:41" (1/3) ... [2023-12-24 21:28:42,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d59205f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:28:42, skipping insertion in model container [2023-12-24 21:28:42,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:28:42" (2/3) ... [2023-12-24 21:28:42,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d59205f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:28:42, skipping insertion in model container [2023-12-24 21:28:42,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:28:42" (3/3) ... [2023-12-24 21:28:42,824 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2023-12-24 21:28:42,836 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 21:28:42,837 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 21:28:42,875 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 21:28:42,879 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;@3214b2b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 21:28:42,880 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 21:28:42,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.68) internal successors, (42), 26 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:28:42,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-24 21:28:42,887 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:28:42,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:28:42,888 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:28:42,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:28:42,891 INFO L85 PathProgramCache]: Analyzing trace with hash -455146651, now seen corresponding path program 1 times [2023-12-24 21:28:42,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:28:42,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978617468] [2023-12-24 21:28:42,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:28:42,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:42,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:28:42,901 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:28:42,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 21:28:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:28:43,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 21:28:43,013 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:28:43,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:28:43,028 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:28:43,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:28:43,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978617468] [2023-12-24 21:28:43,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978617468] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:28:43,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:28:43,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:28:43,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648843629] [2023-12-24 21:28:43,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:28:43,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 21:28:43,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:28:43,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 21:28:43,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:28:43,052 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.68) internal successors, (42), 26 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 21:28:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:28:43,125 INFO L93 Difference]: Finished difference Result 48 states and 75 transitions. [2023-12-24 21:28:43,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 21:28:43,126 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-12-24 21:28:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:28:43,130 INFO L225 Difference]: With dead ends: 48 [2023-12-24 21:28:43,130 INFO L226 Difference]: Without dead ends: 22 [2023-12-24 21:28:43,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:28:43,134 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:28:43,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:28:43,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-24 21:28:43,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-24 21:28:43,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:28:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-12-24 21:28:43,157 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2023-12-24 21:28:43,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:28:43,158 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-12-24 21:28:43,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 21:28:43,158 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-12-24 21:28:43,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-24 21:28:43,159 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:28:43,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:28:43,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 21:28:43,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:43,367 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:28:43,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:28:43,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1566924888, now seen corresponding path program 1 times [2023-12-24 21:28:43,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:28:43,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734982008] [2023-12-24 21:28:43,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:28:43,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:43,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:28:43,373 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:28:43,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 21:28:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:28:43,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:28:43,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:28:43,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:28:43,514 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:28:43,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:28:43,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734982008] [2023-12-24 21:28:43,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734982008] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:28:43,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:28:43,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 21:28:43,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426728372] [2023-12-24 21:28:43,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:28:43,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:28:43,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:28:43,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:28:43,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:28:43,518 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 21:28:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:28:43,632 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2023-12-24 21:28:43,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:28:43,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-12-24 21:28:43,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:28:43,633 INFO L225 Difference]: With dead ends: 38 [2023-12-24 21:28:43,634 INFO L226 Difference]: Without dead ends: 27 [2023-12-24 21:28:43,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:28:43,635 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:28:43,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 37 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:28:43,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-24 21:28:43,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2023-12-24 21:28:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:28:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-12-24 21:28:43,639 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 15 [2023-12-24 21:28:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:28:43,640 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-12-24 21:28:43,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 21:28:43,640 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-12-24 21:28:43,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-24 21:28:43,640 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:28:43,641 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:28:43,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 21:28:43,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:43,844 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:28:43,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:28:43,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1754489508, now seen corresponding path program 1 times [2023-12-24 21:28:43,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:28:43,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172262863] [2023-12-24 21:28:43,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:28:43,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:43,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:28:43,847 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:28:43,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 21:28:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:28:43,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 21:28:43,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:28:44,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 21:28:44,004 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:28:44,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:28:44,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172262863] [2023-12-24 21:28:44,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172262863] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:28:44,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:28:44,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 21:28:44,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213020662] [2023-12-24 21:28:44,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:28:44,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:28:44,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:28:44,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:28:44,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:28:44,010 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:28:44,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:28:44,120 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2023-12-24 21:28:44,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 21:28:44,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-12-24 21:28:44,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:28:44,121 INFO L225 Difference]: With dead ends: 39 [2023-12-24 21:28:44,121 INFO L226 Difference]: Without dead ends: 32 [2023-12-24 21:28:44,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:28:44,122 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 34 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:28:44,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 35 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:28:44,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-24 21:28:44,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2023-12-24 21:28:44,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:28:44,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-12-24 21:28:44,127 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 23 [2023-12-24 21:28:44,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:28:44,127 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-12-24 21:28:44,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:28:44,127 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-12-24 21:28:44,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-24 21:28:44,128 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:28:44,128 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:28:44,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 21:28:44,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:44,332 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:28:44,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:28:44,332 INFO L85 PathProgramCache]: Analyzing trace with hash -600650578, now seen corresponding path program 1 times [2023-12-24 21:28:44,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:28:44,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31540448] [2023-12-24 21:28:44,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:28:44,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:44,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:28:44,334 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:28:44,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 21:28:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:28:44,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:28:44,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:28:44,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 21:28:44,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:28:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 21:28:44,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:28:44,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31540448] [2023-12-24 21:28:44,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31540448] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:28:44,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:28:44,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-24 21:28:44,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980832010] [2023-12-24 21:28:44,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:28:44,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 21:28:44,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:28:44,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 21:28:44,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-24 21:28:44,593 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 21:28:44,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:28:44,810 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2023-12-24 21:28:44,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 21:28:44,811 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2023-12-24 21:28:44,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:28:44,811 INFO L225 Difference]: With dead ends: 48 [2023-12-24 21:28:44,811 INFO L226 Difference]: Without dead ends: 41 [2023-12-24 21:28:44,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-24 21:28:44,812 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 65 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:28:44,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 76 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 21:28:44,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-24 21:28:44,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2023-12-24 21:28:44,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:28:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2023-12-24 21:28:44,817 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 26 [2023-12-24 21:28:44,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:28:44,817 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2023-12-24 21:28:44,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 21:28:44,818 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2023-12-24 21:28:44,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-24 21:28:44,818 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:28:44,818 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:28:44,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 21:28:45,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:45,028 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:28:45,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:28:45,029 INFO L85 PathProgramCache]: Analyzing trace with hash 791643164, now seen corresponding path program 2 times [2023-12-24 21:28:45,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:28:45,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596405725] [2023-12-24 21:28:45,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:28:45,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:45,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:28:45,030 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:28:45,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 21:28:45,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:28:45,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:28:45,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 21:28:45,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:28:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 21:28:45,198 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:28:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 21:28:45,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:28:45,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596405725] [2023-12-24 21:28:45,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596405725] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:28:45,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:28:45,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-24 21:28:45,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150574355] [2023-12-24 21:28:45,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:28:45,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 21:28:45,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:28:45,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 21:28:45,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-24 21:28:45,238 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:28:45,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:28:45,548 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2023-12-24 21:28:45,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 21:28:45,549 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-12-24 21:28:45,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:28:45,549 INFO L225 Difference]: With dead ends: 56 [2023-12-24 21:28:45,549 INFO L226 Difference]: Without dead ends: 46 [2023-12-24 21:28:45,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-12-24 21:28:45,557 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 48 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 21:28:45,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 124 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 21:28:45,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-24 21:28:45,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 28. [2023-12-24 21:28:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:28:45,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2023-12-24 21:28:45,562 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 29 [2023-12-24 21:28:45,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:28:45,563 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2023-12-24 21:28:45,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:28:45,563 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2023-12-24 21:28:45,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-24 21:28:45,563 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:28:45,563 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:28:45,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 21:28:45,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:45,768 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:28:45,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:28:45,769 INFO L85 PathProgramCache]: Analyzing trace with hash -768538363, now seen corresponding path program 1 times [2023-12-24 21:28:45,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:28:45,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435267747] [2023-12-24 21:28:45,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:28:45,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:45,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:28:45,770 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:28:45,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-24 21:28:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:28:45,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 57 conjunts are in the unsatisfiable core [2023-12-24 21:28:45,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:28:45,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:28:46,066 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 21:28:46,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-24 21:28:46,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:28:46,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:28:46,211 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2023-12-24 21:28:46,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 83 [2023-12-24 21:28:46,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 18 [2023-12-24 21:28:46,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2023-12-24 21:28:46,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:28:46,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-24 21:28:46,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-24 21:28:46,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 16 treesize of output 11 [2023-12-24 21:28:46,550 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 15 treesize of output 7 [2023-12-24 21:28:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:28:46,574 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:28:46,711 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_321 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))))) is different from false [2023-12-24 21:28:46,739 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_321 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_321) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))))) is different from false [2023-12-24 21:28:46,748 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_321 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_321) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))))) is different from false [2023-12-24 21:28:46,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:28:46,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-24 21:28:46,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:28:46,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2023-12-24 21:28:46,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-12-24 21:28:46,832 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~s~0#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (forall ((v_ArrVal_320 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_320 (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_320 .cse0))))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_320) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (= |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_dll_circular_update_at_~data#1|)) is different from false [2023-12-24 21:28:47,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:28:47,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-12-24 21:28:47,128 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 65 treesize of output 57 [2023-12-24 21:28:47,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-24 21:28:47,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-24 21:28:47,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-24 21:28:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-12-24 21:28:47,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:28:47,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435267747] [2023-12-24 21:28:47,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435267747] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:28:47,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:28:47,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 38 [2023-12-24 21:28:47,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846924614] [2023-12-24 21:28:47,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:28:47,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-24 21:28:47,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:28:47,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-24 21:28:47,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1030, Unknown=12, NotChecked=268, Total=1406 [2023-12-24 21:28:47,497 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 38 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 33 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:28:49,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:28:49,485 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2023-12-24 21:28:49,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-24 21:28:49,485 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 33 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2023-12-24 21:28:49,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:28:49,486 INFO L225 Difference]: With dead ends: 65 [2023-12-24 21:28:49,487 INFO L226 Difference]: Without dead ends: 63 [2023-12-24 21:28:49,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=169, Invalid=1641, Unknown=12, NotChecked=340, Total=2162 [2023-12-24 21:28:49,488 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 103 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-24 21:28:49,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 353 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 555 Invalid, 0 Unknown, 232 Unchecked, 1.5s Time] [2023-12-24 21:28:49,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-24 21:28:49,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2023-12-24 21:28:49,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:28:49,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2023-12-24 21:28:49,496 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 30 [2023-12-24 21:28:49,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:28:49,496 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2023-12-24 21:28:49,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 33 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:28:49,496 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2023-12-24 21:28:49,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-24 21:28:49,497 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:28:49,497 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:28:49,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-24 21:28:49,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:49,697 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:28:49,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:28:49,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1945133887, now seen corresponding path program 1 times [2023-12-24 21:28:49,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:28:49,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973733277] [2023-12-24 21:28:49,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:28:49,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:49,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:28:49,699 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:28:49,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 21:28:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:28:49,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:28:49,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:28:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-24 21:28:49,827 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:28:49,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:28:49,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973733277] [2023-12-24 21:28:49,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973733277] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:28:49,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:28:49,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 21:28:49,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013354227] [2023-12-24 21:28:49,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:28:49,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:28:49,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:28:49,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:28:49,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:28:49,828 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:28:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:28:49,955 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2023-12-24 21:28:49,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 21:28:49,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2023-12-24 21:28:49,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:28:49,956 INFO L225 Difference]: With dead ends: 59 [2023-12-24 21:28:49,956 INFO L226 Difference]: Without dead ends: 53 [2023-12-24 21:28:49,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 21:28:49,957 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:28:49,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 55 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:28:49,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-24 21:28:49,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2023-12-24 21:28:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:28:49,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2023-12-24 21:28:49,966 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 31 [2023-12-24 21:28:49,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:28:49,966 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2023-12-24 21:28:49,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:28:49,966 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2023-12-24 21:28:49,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-24 21:28:49,967 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:28:49,967 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:28:49,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-24 21:28:50,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:50,172 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:28:50,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:28:50,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1889525444, now seen corresponding path program 2 times [2023-12-24 21:28:50,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:28:50,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364784945] [2023-12-24 21:28:50,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:28:50,173 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:50,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:28:50,174 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:28:50,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-24 21:28:50,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:28:50,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:28:50,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 21:28:50,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:28:50,347 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 21:28:50,347 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:28:50,394 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 21:28:50,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:28:50,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364784945] [2023-12-24 21:28:50,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364784945] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:28:50,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:28:50,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-24 21:28:50,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892980176] [2023-12-24 21:28:50,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:28:50,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 21:28:50,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:28:50,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 21:28:50,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-24 21:28:50,396 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:28:50,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:28:50,700 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2023-12-24 21:28:50,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 21:28:50,700 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2023-12-24 21:28:50,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:28:50,701 INFO L225 Difference]: With dead ends: 81 [2023-12-24 21:28:50,701 INFO L226 Difference]: Without dead ends: 65 [2023-12-24 21:28:50,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-12-24 21:28:50,702 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 21:28:50,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 130 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 21:28:50,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-24 21:28:50,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2023-12-24 21:28:50,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:28:50,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2023-12-24 21:28:50,709 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 31 [2023-12-24 21:28:50,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:28:50,710 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2023-12-24 21:28:50,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:28:50,710 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2023-12-24 21:28:50,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-24 21:28:50,710 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:28:50,710 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:28:50,724 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 (9)] Forceful destruction successful, exit code 0 [2023-12-24 21:28:50,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:50,916 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:28:50,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:28:50,916 INFO L85 PathProgramCache]: Analyzing trace with hash 740548731, now seen corresponding path program 1 times [2023-12-24 21:28:50,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:28:50,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841336887] [2023-12-24 21:28:50,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:28:50,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:50,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:28:50,918 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:28:50,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-24 21:28:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:28:51,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 21:28:51,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:28:51,074 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-24 21:28:51,074 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:28:51,101 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-24 21:28:51,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:28:51,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841336887] [2023-12-24 21:28:51,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841336887] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:28:51,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:28:51,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-24 21:28:51,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947036808] [2023-12-24 21:28:51,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:28:51,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 21:28:51,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:28:51,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 21:28:51,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-24 21:28:51,104 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:28:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:28:51,341 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2023-12-24 21:28:51,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 21:28:51,341 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2023-12-24 21:28:51,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:28:51,342 INFO L225 Difference]: With dead ends: 78 [2023-12-24 21:28:51,342 INFO L226 Difference]: Without dead ends: 72 [2023-12-24 21:28:51,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-12-24 21:28:51,343 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 47 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:28:51,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 84 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 21:28:51,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-24 21:28:51,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2023-12-24 21:28:51,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:28:51,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2023-12-24 21:28:51,350 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 34 [2023-12-24 21:28:51,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:28:51,350 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2023-12-24 21:28:51,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:28:51,351 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2023-12-24 21:28:51,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-24 21:28:51,351 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:28:51,351 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:28:51,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-24 21:28:51,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:51,556 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:28:51,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:28:51,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1482193545, now seen corresponding path program 1 times [2023-12-24 21:28:51,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:28:51,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171735542] [2023-12-24 21:28:51,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:28:51,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:51,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:28:51,558 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:28:51,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-24 21:28:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:28:51,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-24 21:28:51,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:28:51,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:28:51,859 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 21:28:51,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-24 21:28:51,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:28:51,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:28:51,996 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2023-12-24 21:28:51,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 83 [2023-12-24 21:28:52,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 46 [2023-12-24 21:28:52,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 20 [2023-12-24 21:28:52,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-24 21:28:52,255 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:28:52,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 61 [2023-12-24 21:28:52,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-12-24 21:28:52,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2023-12-24 21:28:52,549 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 33 treesize of output 21 [2023-12-24 21:28:52,552 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 21 treesize of output 13 [2023-12-24 21:28:52,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-12-24 21:28:52,624 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:28:52,624 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:28:52,881 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 76 treesize of output 56 [2023-12-24 21:28:53,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:28:53,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-12-24 21:28:53,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2023-12-24 21:28:53,175 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_602 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_602) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= v_ArrVal_602 (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_602 .cse0))))))) (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2023-12-24 21:28:53,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:28:53,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-12-24 21:28:53,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 119 [2023-12-24 21:28:53,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-24 21:28:53,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-24 21:28:53,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-24 21:28:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-12-24 21:28:53,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:28:53,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171735542] [2023-12-24 21:28:53,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171735542] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:28:53,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:28:53,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 41 [2023-12-24 21:28:53,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051544414] [2023-12-24 21:28:53,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:28:53,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-24 21:28:53,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:28:53,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-24 21:28:53,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1429, Unknown=28, NotChecked=76, Total=1640 [2023-12-24 21:28:53,845 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 41 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 36 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:28:56,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:28:56,714 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2023-12-24 21:28:56,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-24 21:28:56,715 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 36 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2023-12-24 21:28:56,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:28:56,715 INFO L225 Difference]: With dead ends: 86 [2023-12-24 21:28:56,716 INFO L226 Difference]: Without dead ends: 84 [2023-12-24 21:28:56,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=177, Invalid=2150, Unknown=29, NotChecked=94, Total=2450 [2023-12-24 21:28:56,717 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 49 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-24 21:28:56,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 461 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 806 Invalid, 0 Unknown, 60 Unchecked, 2.3s Time] [2023-12-24 21:28:56,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-24 21:28:56,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 64. [2023-12-24 21:28:56,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:28:56,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2023-12-24 21:28:56,730 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 35 [2023-12-24 21:28:56,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:28:56,730 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2023-12-24 21:28:56,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 36 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:28:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2023-12-24 21:28:56,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-24 21:28:56,731 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:28:56,731 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-24 21:28:56,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-24 21:28:56,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:56,940 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:28:56,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:28:56,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1621294267, now seen corresponding path program 3 times [2023-12-24 21:28:56,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:28:56,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238464648] [2023-12-24 21:28:56,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 21:28:56,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:56,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:28:56,942 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:28:56,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-24 21:28:57,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-24 21:28:57,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:28:57,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 21:28:57,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:28:57,193 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-24 21:28:57,193 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:28:57,263 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-24 21:28:57,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:28:57,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238464648] [2023-12-24 21:28:57,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1238464648] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:28:57,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:28:57,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-24 21:28:57,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212247564] [2023-12-24 21:28:57,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:28:57,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 21:28:57,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:28:57,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 21:28:57,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-24 21:28:57,265 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 21:28:57,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:28:57,547 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2023-12-24 21:28:57,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 21:28:57,547 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2023-12-24 21:28:57,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:28:57,548 INFO L225 Difference]: With dead ends: 83 [2023-12-24 21:28:57,548 INFO L226 Difference]: Without dead ends: 57 [2023-12-24 21:28:57,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-24 21:28:57,548 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 18 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 21:28:57,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 103 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 21:28:57,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-24 21:28:57,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2023-12-24 21:28:57,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:28:57,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2023-12-24 21:28:57,555 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 35 [2023-12-24 21:28:57,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:28:57,555 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2023-12-24 21:28:57,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 21:28:57,555 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2023-12-24 21:28:57,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-24 21:28:57,556 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:28:57,556 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:28:57,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-24 21:28:57,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:57,763 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:28:57,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:28:57,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1296620997, now seen corresponding path program 2 times [2023-12-24 21:28:57,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:28:57,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151197626] [2023-12-24 21:28:57,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:28:57,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:57,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:28:57,765 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:28:57,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-24 21:28:57,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:28:57,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:28:57,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 21:28:57,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:28:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-24 21:28:57,947 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:28:57,990 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-24 21:28:57,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:28:57,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151197626] [2023-12-24 21:28:57,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151197626] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:28:57,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:28:57,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-24 21:28:57,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112752050] [2023-12-24 21:28:57,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:28:57,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 21:28:57,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:28:57,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 21:28:57,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-24 21:28:57,992 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:28:58,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:28:58,276 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2023-12-24 21:28:58,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 21:28:58,277 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2023-12-24 21:28:58,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:28:58,277 INFO L225 Difference]: With dead ends: 62 [2023-12-24 21:28:58,277 INFO L226 Difference]: Without dead ends: 40 [2023-12-24 21:28:58,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-12-24 21:28:58,278 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 21:28:58,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 127 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 21:28:58,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-24 21:28:58,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2023-12-24 21:28:58,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:28:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2023-12-24 21:28:58,282 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 36 [2023-12-24 21:28:58,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:28:58,283 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-12-24 21:28:58,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:28:58,283 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2023-12-24 21:28:58,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-24 21:28:58,283 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:28:58,283 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:28:58,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-24 21:28:58,488 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-24 21:28:58,489 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:28:58,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:28:58,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1318083711, now seen corresponding path program 4 times [2023-12-24 21:28:58,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:28:58,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041888571] [2023-12-24 21:28:58,489 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-24 21:28:58,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:58,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:28:58,490 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:28:58,492 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 (14)] Waiting until timeout for monitored process [2023-12-24 21:28:58,631 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-24 21:28:58,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:28:58,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 21:28:58,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:28:58,653 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-24 21:28:58,654 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:28:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-24 21:28:58,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:28:58,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041888571] [2023-12-24 21:28:58,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041888571] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:28:58,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:28:58,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-24 21:28:58,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885958924] [2023-12-24 21:28:58,690 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:28:58,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 21:28:58,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:28:58,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 21:28:58,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:28:58,691 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-24 21:28:58,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:28:58,778 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2023-12-24 21:28:58,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 21:28:58,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 38 [2023-12-24 21:28:58,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:28:58,779 INFO L225 Difference]: With dead ends: 41 [2023-12-24 21:28:58,779 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 21:28:58,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:28:58,779 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:28:58,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 26 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:28:58,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 21:28:58,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 21:28:58,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:28:58,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 21:28:58,780 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2023-12-24 21:28:58,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:28:58,780 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 21:28:58,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-24 21:28:58,780 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 21:28:58,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 21:28:58,782 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 21:28:58,789 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 (14)] Ended with exit code 0 [2023-12-24 21:28:58,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:28:58,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 21:28:59,280 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (and (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (bvadd (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))) [2023-12-24 21:28:59,280 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2023-12-24 21:28:59,280 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 626 645) no Hoare annotation was computed. [2023-12-24 21:28:59,280 INFO L895 garLoopResultBuilder]: At program point L631-3(lines 631 634) the Hoare annotation is: (let ((.cse4 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)))) (let ((.cse0 (= (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) (_ bv8 32)) (_ bv2 32))) (.cse1 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32))) (.cse2 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse3 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse4)))) (or (and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) .cse2 .cse3 (= (select (select |#memory_int#1| .cse4) (bvadd (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv8 32))) (_ bv3 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) .cse1 .cse2 .cse3)))) [2023-12-24 21:28:59,280 INFO L899 garLoopResultBuilder]: For program point L631-4(lines 631 634) no Hoare annotation was computed. [2023-12-24 21:28:59,280 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 593) no Hoare annotation was computed. [2023-12-24 21:28:59,280 INFO L899 garLoopResultBuilder]: For program point L591-2(lines 591 593) no Hoare annotation was computed. [2023-12-24 21:28:59,280 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 21:28:59,280 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2023-12-24 21:28:59,280 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2023-12-24 21:28:59,280 INFO L895 garLoopResultBuilder]: At program point L635-3(lines 635 640) the Hoare annotation is: (let ((.cse4 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)))) (let ((.cse0 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32))) (.cse1 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse2 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse4))) (.cse3 (= (select (select |#memory_int#1| .cse4) (bvadd (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv8 32))) (_ bv3 32)))) (or (and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) .cse0 .cse1 .cse2 .cse3) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) .cse1) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) (_ bv8 32)) (_ bv2 32)) .cse0 .cse1 .cse2 .cse3)))) [2023-12-24 21:28:59,281 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 643) no Hoare annotation was computed. [2023-12-24 21:28:59,281 INFO L899 garLoopResultBuilder]: For program point L635-4(lines 635 640) no Hoare annotation was computed. [2023-12-24 21:28:59,281 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (and (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))) [2023-12-24 21:28:59,281 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-12-24 21:28:59,281 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 21:28:59,281 INFO L895 garLoopResultBuilder]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse9 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)))) (let ((.cse0 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| (_ bv0 32))) (.cse6 (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32))) (.cse7 (= (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) (_ bv8 32)) (_ bv2 32))) (.cse2 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32))) (.cse3 (= |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32))) (.cse4 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse5 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse9))) (.cse8 (= (_ bv3 32) |ULTIMATE.start_dll_circular_update_at_~data#1|))) (or (and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) .cse0 (= (_ bv2 32) |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse1 .cse2 (= (_ bv1 32) |ULTIMATE.start_dll_circular_update_at_~index#1|) .cse4 .cse5 .cse8) (and .cse6 .cse7 .cse2 .cse3 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| .cse9) .cse4 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) .cse5 .cse8)))) [2023-12-24 21:28:59,281 INFO L899 garLoopResultBuilder]: For program point L620-3(lines 620 623) no Hoare annotation was computed. [2023-12-24 21:28:59,281 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 639) no Hoare annotation was computed. [2023-12-24 21:28:59,281 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2023-12-24 21:28:59,281 INFO L899 garLoopResultBuilder]: For program point L604-3(lines 604 608) no Hoare annotation was computed. [2023-12-24 21:28:59,281 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 626 645) no Hoare annotation was computed. [2023-12-24 21:28:59,281 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (or (and .cse0 (= (bvadd (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)) (_ bv0 1)) .cse1 (= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))) (and (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv0 32))) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (not .cse0) .cse1 (= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv1 32))))) [2023-12-24 21:28:59,281 INFO L899 garLoopResultBuilder]: For program point L588-3(lines 588 596) no Hoare annotation was computed. [2023-12-24 21:28:59,281 INFO L895 garLoopResultBuilder]: At program point L613-2(lines 613 616) the Hoare annotation is: (let ((.cse9 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)))) (let ((.cse2 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv0 32))) (.cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32))) (.cse7 (= |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv0 32))) (.cse3 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32))) (.cse4 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse5 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse9))) (.cse6 (= (select (select |#memory_int#1| .cse9) (bvadd (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32)) (_ bv8 32))) (_ bv3 32))) (.cse8 (select |#memory_int#1| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|))) (or (let ((.cse1 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv0 32)))) (and (= |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv1 32)) .cse0 (= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int#1| .cse1) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv0 32))))) .cse2 .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| .cse1)) .cse6)) (and .cse7 (= |ULTIMATE.start_main_~expected~0#1| (select .cse8 (_ bv8 32))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) .cse2 (= (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) (_ bv8 32)) (_ bv2 32)) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse3 .cse4 .cse5 .cse6 (= (select .cse8 (bvadd |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv8 32))) |ULTIMATE.start_main_~expected~0#1|))))) [2023-12-24 21:28:59,282 INFO L899 garLoopResultBuilder]: For program point L613-3(lines 613 616) no Hoare annotation was computed. [2023-12-24 21:28:59,282 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2023-12-24 21:28:59,282 INFO L899 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2023-12-24 21:28:59,282 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 575 584) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-12-24 21:28:59,282 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2023-12-24 21:28:59,284 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1] [2023-12-24 21:28:59,285 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 21:28:59,293 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:28:59,294 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:28:59,294 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated [2023-12-24 21:28:59,294 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:28:59,295 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8bv32] could not be translated [2023-12-24 21:28:59,295 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:28:59,295 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated [2023-12-24 21:28:59,295 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8bv32] could not be translated [2023-12-24 21:28:59,295 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:28:59,295 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated [2023-12-24 21:28:59,295 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0bv32] could not be translated [2023-12-24 21:28:59,295 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:28:59,295 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated [2023-12-24 21:28:59,296 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated [2023-12-24 21:28:59,296 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0bv32]][~bvadd~32(#memory_$Pointer$#1.offset[~s~0!base][0bv32], 8bv32)] could not be translated [2023-12-24 21:28:59,297 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8bv32] could not be translated [2023-12-24 21:28:59,297 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated [2023-12-24 21:28:59,297 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0bv32]][~bvadd~32(#memory_$Pointer$#1.offset[~s~0!base][0bv32], 8bv32)] could not be translated [2023-12-24 21:28:59,297 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8bv32] could not be translated [2023-12-24 21:28:59,297 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated [2023-12-24 21:28:59,297 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8bv32] could not be translated [2023-12-24 21:28:59,298 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated [2023-12-24 21:28:59,298 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0bv32]][~bvadd~32(#memory_$Pointer$#1.offset[~s~0!base][0bv32], 8bv32)] could not be translated [2023-12-24 21:28:59,298 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated [2023-12-24 21:28:59,298 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-24 21:28:59,299 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][0bv32] could not be translated [2023-12-24 21:28:59,299 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~head!base][0bv32]][~bvadd~32(8bv32, #memory_$Pointer$#1.offset[~head!base][0bv32])] could not be translated [2023-12-24 21:28:59,300 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:28:59,300 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated [2023-12-24 21:28:59,300 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:28:59,300 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0bv32] could not be translated [2023-12-24 21:28:59,300 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0bv32]][~bvadd~32(#memory_$Pointer$#1.offset[~s~0!base][0bv32], 8bv32)] could not be translated [2023-12-24 21:28:59,300 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][8bv32] could not be translated [2023-12-24 21:28:59,300 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:28:59,300 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8bv32] could not be translated [2023-12-24 21:28:59,300 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated [2023-12-24 21:28:59,300 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0bv32]][~bvadd~32(#memory_$Pointer$#1.offset[~s~0!base][0bv32], 8bv32)] could not be translated [2023-12-24 21:28:59,300 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated [2023-12-24 21:28:59,301 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0bv32]][~bvadd~32(#memory_$Pointer$#1.offset[~s~0!base][0bv32], 8bv32)] could not be translated [2023-12-24 21:28:59,301 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][~bvadd~32(~head!offset, 8bv32)] could not be translated [2023-12-24 21:28:59,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 09:28:59 BoogieIcfgContainer [2023-12-24 21:28:59,301 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 21:28:59,301 INFO L158 Benchmark]: Toolchain (without parser) took 17382.54ms. Allocated memory was 240.1MB in the beginning and 323.0MB in the end (delta: 82.8MB). Free memory was 184.8MB in the beginning and 234.3MB in the end (delta: -49.5MB). Peak memory consumption was 34.9MB. Max. memory is 8.0GB. [2023-12-24 21:28:59,301 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 196.1MB. Free memory was 145.2MB in the beginning and 145.0MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 21:28:59,302 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.97ms. Allocated memory is still 240.1MB. Free memory was 184.8MB in the beginning and 165.3MB in the end (delta: 19.5MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-24 21:28:59,302 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.72ms. Allocated memory is still 240.1MB. Free memory was 165.3MB in the beginning and 162.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 21:28:59,302 INFO L158 Benchmark]: Boogie Preprocessor took 52.32ms. Allocated memory is still 240.1MB. Free memory was 162.8MB in the beginning and 159.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 21:28:59,302 INFO L158 Benchmark]: RCFGBuilder took 414.12ms. Allocated memory is still 240.1MB. Free memory was 159.7MB in the beginning and 138.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-24 21:28:59,302 INFO L158 Benchmark]: TraceAbstraction took 16480.38ms. Allocated memory was 240.1MB in the beginning and 323.0MB in the end (delta: 82.8MB). Free memory was 138.2MB in the beginning and 234.3MB in the end (delta: -96.1MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 21:28:59,303 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.12ms. Allocated memory is still 196.1MB. Free memory was 145.2MB in the beginning and 145.0MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 380.97ms. Allocated memory is still 240.1MB. Free memory was 184.8MB in the beginning and 165.3MB in the end (delta: 19.5MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.72ms. Allocated memory is still 240.1MB. Free memory was 165.3MB in the beginning and 162.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.32ms. Allocated memory is still 240.1MB. Free memory was 162.8MB in the beginning and 159.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 414.12ms. Allocated memory is still 240.1MB. Free memory was 159.7MB in the beginning and 138.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 16480.38ms. Allocated memory was 240.1MB in the beginning and 323.0MB in the end (delta: 82.8MB). Free memory was 138.2MB in the beginning and 234.3MB in the end (delta: -96.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0bv32]][~bvadd~32(#memory_$Pointer$#1.offset[~s~0!base][0bv32], 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0bv32]][~bvadd~32(#memory_$Pointer$#1.offset[~s~0!base][0bv32], 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0bv32]][~bvadd~32(#memory_$Pointer$#1.offset[~s~0!base][0bv32], 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~head!base][0bv32]][~bvadd~32(8bv32, #memory_$Pointer$#1.offset[~head!base][0bv32])] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0bv32]][~bvadd~32(#memory_$Pointer$#1.offset[~s~0!base][0bv32], 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][8bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0bv32]][~bvadd~32(#memory_$Pointer$#1.offset[~s~0!base][0bv32], 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0bv32]][~bvadd~32(#memory_$Pointer$#1.offset[~s~0!base][0bv32], 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][~bvadd~32(~head!offset, 8bv32)] could not be translated * 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 - PositiveResult [Line: 643]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.4s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 419 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 418 mSDsluCounter, 1643 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 292 IncrementalHoareTripleChecker+Unchecked, 1376 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1880 IncrementalHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 267 mSDtfsCounter, 1880 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 686 GetRequests, 523 SyntacticMatches, 5 SemanticMatches, 158 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=10, InterpolantAutomatonStates: 99, 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, 13 MinimizatonAttempts, 119 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 27 NumberOfFragments, 520 HoareAnnotationTreeSize, 11 FormulaSimplifications, 19037 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FormulaSimplificationsInter, 4 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 378 NumberOfCodeBlocks, 377 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 650 ConstructedInterpolants, 24 QuantifiedInterpolants, 2800 SizeOfPredicates, 65 NumberOfNonLiveVariables, 2669 ConjunctsInSsa, 167 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 208/300 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: ((((2 == data) && (index == 0)) || ((1 == index) && (3 == data))) || ((index == 0) && (3 == data))) - InvariantResult [Line: 635]: Loop Invariant Derived loop invariant: ((((i == 1) && (2 == len)) || ((i == 2) && (2 == len))) || ((i == 0) && (2 == len))) - InvariantResult [Line: 631]: Loop Invariant Derived loop invariant: ((((i == 1) && (2 == len)) || ((i == 2) && (2 == len))) || ((i == 0) && (2 == len))) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: (((2 == len) && (len == 2)) || ((2 == len) && (len == 1))) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: (((index == 1) || (index == 0)) || (index == 0)) RESULT: Ultimate proved your program to be correct! [2023-12-24 21:28:59,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...