/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/systemc/bist_cell.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 07:08:36,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 07:08:36,807 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-25 07:08:36,811 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 07:08:36,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 07:08:36,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 07:08:36,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 07:08:36,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 07:08:36,833 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 07:08:36,836 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 07:08:36,836 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 07:08:36,836 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 07:08:36,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 07:08:36,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 07:08:36,838 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 07:08:36,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 07:08:36,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 07:08:36,839 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 07:08:36,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 07:08:36,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 07:08:36,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 07:08:36,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 07:08:36,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 07:08:36,840 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 07:08:36,840 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 07:08:36,840 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 07:08:36,840 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 07:08:36,841 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 07:08:36,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 07:08:36,841 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 07:08:36,842 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 07:08:36,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 07:08:36,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 07:08:36,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 07:08:36,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:08:36,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 07:08:36,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 07:08:36,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 07:08:36,843 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 07:08:36,843 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 07:08:36,843 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 07:08:36,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 07:08:36,843 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 07:08:36,844 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 07:08:36,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 07:08:36,844 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 07:08:36,844 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-25 07:08:37,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 07:08:37,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 07:08:37,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 07:08:37,040 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 07:08:37,040 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 07:08:37,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/bist_cell.cil.c [2023-12-25 07:08:38,150 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 07:08:38,304 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 07:08:38,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c [2023-12-25 07:08:38,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a48106ab/0ea2431282284e59be27723c994460f7/FLAGf74bb0bae [2023-12-25 07:08:38,322 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a48106ab/0ea2431282284e59be27723c994460f7 [2023-12-25 07:08:38,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 07:08:38,324 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 07:08:38,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 07:08:38,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 07:08:38,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 07:08:38,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:08:38" (1/1) ... [2023-12-25 07:08:38,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60abfb42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:38, skipping insertion in model container [2023-12-25 07:08:38,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:08:38" (1/1) ... [2023-12-25 07:08:38,350 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 07:08:38,434 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c[639,652] [2023-12-25 07:08:38,465 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:08:38,475 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 07:08:38,482 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c[639,652] [2023-12-25 07:08:38,504 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:08:38,515 INFO L206 MainTranslator]: Completed translation [2023-12-25 07:08:38,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:38 WrapperNode [2023-12-25 07:08:38,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 07:08:38,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 07:08:38,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 07:08:38,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 07:08:38,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:38" (1/1) ... [2023-12-25 07:08:38,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:38" (1/1) ... [2023-12-25 07:08:38,548 INFO L138 Inliner]: procedures = 30, calls = 30, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 224 [2023-12-25 07:08:38,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 07:08:38,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 07:08:38,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 07:08:38,549 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 07:08:38,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:38" (1/1) ... [2023-12-25 07:08:38,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:38" (1/1) ... [2023-12-25 07:08:38,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:38" (1/1) ... [2023-12-25 07:08:38,576 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 07:08:38,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:38" (1/1) ... [2023-12-25 07:08:38,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:38" (1/1) ... [2023-12-25 07:08:38,596 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:38" (1/1) ... [2023-12-25 07:08:38,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:38" (1/1) ... [2023-12-25 07:08:38,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:38" (1/1) ... [2023-12-25 07:08:38,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:38" (1/1) ... [2023-12-25 07:08:38,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 07:08:38,612 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 07:08:38,612 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 07:08:38,612 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 07:08:38,612 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:38" (1/1) ... [2023-12-25 07:08:38,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:08:38,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 07:08:38,655 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-25 07:08:38,675 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-25 07:08:38,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 07:08:38,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 07:08:38,691 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-25 07:08:38,692 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-25 07:08:38,692 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-25 07:08:38,693 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-25 07:08:38,693 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-25 07:08:38,693 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-25 07:08:38,693 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-25 07:08:38,693 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-25 07:08:38,693 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-25 07:08:38,693 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-25 07:08:38,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 07:08:38,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 07:08:38,770 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 07:08:38,772 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 07:08:39,108 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 07:08:39,170 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 07:08:39,170 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 07:08:39,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:08:39 BoogieIcfgContainer [2023-12-25 07:08:39,170 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 07:08:39,172 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 07:08:39,172 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 07:08:39,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 07:08:39,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 07:08:38" (1/3) ... [2023-12-25 07:08:39,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39dd782e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:08:39, skipping insertion in model container [2023-12-25 07:08:39,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:08:38" (2/3) ... [2023-12-25 07:08:39,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39dd782e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:08:39, skipping insertion in model container [2023-12-25 07:08:39,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:08:39" (3/3) ... [2023-12-25 07:08:39,175 INFO L112 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2023-12-25 07:08:39,188 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 07:08:39,188 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 07:08:39,227 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 07:08:39,233 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;@4c73ad17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 07:08:39,233 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 07:08:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 71 states have (on average 1.676056338028169) internal successors, (119), 73 states have internal predecessors, (119), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 07:08:39,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-25 07:08:39,243 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:39,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:39,244 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:39,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:39,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1929751186, now seen corresponding path program 1 times [2023-12-25 07:08:39,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:39,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798117342] [2023-12-25 07:08:39,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:39,262 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-25 07:08:39,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:39,265 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-25 07:08:39,278 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-25 07:08:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:39,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 07:08:39,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:39,417 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-25 07:08:39,417 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:08:39,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:39,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798117342] [2023-12-25 07:08:39,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798117342] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:08:39,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:08:39,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:08:39,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611030448] [2023-12-25 07:08:39,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:08:39,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 07:08:39,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:39,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 07:08:39,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 07:08:39,464 INFO L87 Difference]: Start difference. First operand has 88 states, 71 states have (on average 1.676056338028169) internal successors, (119), 73 states have internal predecessors, (119), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 07:08:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:39,506 INFO L93 Difference]: Finished difference Result 168 states and 265 transitions. [2023-12-25 07:08:39,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 07:08:39,508 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2023-12-25 07:08:39,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:39,513 INFO L225 Difference]: With dead ends: 168 [2023-12-25 07:08:39,514 INFO L226 Difference]: Without dead ends: 86 [2023-12-25 07:08:39,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-25 07:08:39,518 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:39,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:08:39,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-25 07:08:39,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-12-25 07:08:39,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 70 states have (on average 1.6) internal successors, (112), 71 states have internal predecessors, (112), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 07:08:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 132 transitions. [2023-12-25 07:08:39,550 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 132 transitions. Word has length 39 [2023-12-25 07:08:39,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:39,551 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 132 transitions. [2023-12-25 07:08:39,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 07:08:39,551 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 132 transitions. [2023-12-25 07:08:39,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-25 07:08:39,554 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:39,554 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:39,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 07:08:39,757 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-25 07:08:39,758 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:39,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:39,759 INFO L85 PathProgramCache]: Analyzing trace with hash -2086987880, now seen corresponding path program 1 times [2023-12-25 07:08:39,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:39,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794222785] [2023-12-25 07:08:39,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:39,759 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-25 07:08:39,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:39,761 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-25 07:08:39,780 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-25 07:08:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:39,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:08:39,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 07:08:39,936 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:08:39,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:39,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794222785] [2023-12-25 07:08:39,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794222785] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:08:39,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:08:39,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:08:39,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507891865] [2023-12-25 07:08:39,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:08:39,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:08:39,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:39,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:08:39,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:08:39,939 INFO L87 Difference]: Start difference. First operand 86 states and 132 transitions. Second operand has 5 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 07:08:40,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:40,145 INFO L93 Difference]: Finished difference Result 185 states and 286 transitions. [2023-12-25 07:08:40,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 07:08:40,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 90 [2023-12-25 07:08:40,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:40,151 INFO L225 Difference]: With dead ends: 185 [2023-12-25 07:08:40,151 INFO L226 Difference]: Without dead ends: 101 [2023-12-25 07:08:40,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 86 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-25 07:08:40,153 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 63 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:40,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 310 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:08:40,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-25 07:08:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-12-25 07:08:40,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.5952380952380953) internal successors, (134), 85 states have internal predecessors, (134), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-25 07:08:40,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 155 transitions. [2023-12-25 07:08:40,177 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 155 transitions. Word has length 90 [2023-12-25 07:08:40,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:40,178 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 155 transitions. [2023-12-25 07:08:40,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 07:08:40,178 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 155 transitions. [2023-12-25 07:08:40,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-25 07:08:40,185 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:40,185 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:40,199 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-25 07:08:40,389 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-25 07:08:40,390 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:40,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:40,391 INFO L85 PathProgramCache]: Analyzing trace with hash 855139870, now seen corresponding path program 1 times [2023-12-25 07:08:40,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:40,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49329146] [2023-12-25 07:08:40,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:40,392 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-25 07:08:40,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:40,394 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-25 07:08:40,396 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-25 07:08:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:40,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:08:40,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 07:08:40,563 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:08:40,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:40,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49329146] [2023-12-25 07:08:40,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49329146] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:08:40,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:08:40,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:08:40,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924368171] [2023-12-25 07:08:40,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:08:40,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:08:40,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:40,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:08:40,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:08:40,566 INFO L87 Difference]: Start difference. First operand 101 states and 155 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 07:08:40,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:40,734 INFO L93 Difference]: Finished difference Result 224 states and 346 transitions. [2023-12-25 07:08:40,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 07:08:40,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2023-12-25 07:08:40,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:40,737 INFO L225 Difference]: With dead ends: 224 [2023-12-25 07:08:40,737 INFO L226 Difference]: Without dead ends: 126 [2023-12-25 07:08:40,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 88 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-25 07:08:40,742 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 66 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:40,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 298 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:08:40,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-25 07:08:40,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 104. [2023-12-25 07:08:40,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.5862068965517242) internal successors, (138), 88 states have internal predecessors, (138), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-25 07:08:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2023-12-25 07:08:40,758 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 92 [2023-12-25 07:08:40,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:40,758 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2023-12-25 07:08:40,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 07:08:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2023-12-25 07:08:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-25 07:08:40,759 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:40,761 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:40,777 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-25 07:08:40,965 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-25 07:08:40,965 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:40,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:40,966 INFO L85 PathProgramCache]: Analyzing trace with hash 687152296, now seen corresponding path program 1 times [2023-12-25 07:08:40,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:40,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344971107] [2023-12-25 07:08:40,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:40,967 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-25 07:08:40,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:40,981 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-25 07:08:40,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 07:08:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:41,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:08:41,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:41,114 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 07:08:41,114 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:08:41,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:41,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344971107] [2023-12-25 07:08:41,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344971107] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:08:41,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:08:41,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:08:41,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785772804] [2023-12-25 07:08:41,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:08:41,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:08:41,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:41,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:08:41,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:08:41,116 INFO L87 Difference]: Start difference. First operand 104 states and 159 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 07:08:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:41,249 INFO L93 Difference]: Finished difference Result 221 states and 340 transitions. [2023-12-25 07:08:41,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 07:08:41,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 94 [2023-12-25 07:08:41,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:41,252 INFO L225 Difference]: With dead ends: 221 [2023-12-25 07:08:41,252 INFO L226 Difference]: Without dead ends: 123 [2023-12-25 07:08:41,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 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-25 07:08:41,257 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 77 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:41,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 233 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:08:41,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-25 07:08:41,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 107. [2023-12-25 07:08:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.5777777777777777) internal successors, (142), 91 states have internal predecessors, (142), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-25 07:08:41,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 163 transitions. [2023-12-25 07:08:41,274 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 163 transitions. Word has length 94 [2023-12-25 07:08:41,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:41,274 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 163 transitions. [2023-12-25 07:08:41,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 07:08:41,275 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 163 transitions. [2023-12-25 07:08:41,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-25 07:08:41,277 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:41,277 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:41,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-25 07:08:41,481 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-25 07:08:41,481 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:41,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:41,482 INFO L85 PathProgramCache]: Analyzing trace with hash -85910710, now seen corresponding path program 1 times [2023-12-25 07:08:41,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:41,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765915041] [2023-12-25 07:08:41,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:41,483 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-25 07:08:41,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:41,484 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-25 07:08:41,507 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-25 07:08:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:41,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:08:41,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 07:08:41,616 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:08:41,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:41,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765915041] [2023-12-25 07:08:41,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765915041] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:08:41,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:08:41,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:08:41,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108553105] [2023-12-25 07:08:41,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:08:41,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:08:41,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:41,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:08:41,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:08:41,617 INFO L87 Difference]: Start difference. First operand 107 states and 163 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 07:08:41,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:41,751 INFO L93 Difference]: Finished difference Result 218 states and 334 transitions. [2023-12-25 07:08:41,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 07:08:41,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 96 [2023-12-25 07:08:41,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:41,752 INFO L225 Difference]: With dead ends: 218 [2023-12-25 07:08:41,752 INFO L226 Difference]: Without dead ends: 120 [2023-12-25 07:08:41,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 92 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-25 07:08:41,753 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 76 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:41,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 225 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:08:41,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-25 07:08:41,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 110. [2023-12-25 07:08:41,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.5698924731182795) internal successors, (146), 94 states have internal predecessors, (146), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-25 07:08:41,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 167 transitions. [2023-12-25 07:08:41,768 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 167 transitions. Word has length 96 [2023-12-25 07:08:41,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:41,769 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 167 transitions. [2023-12-25 07:08:41,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 07:08:41,769 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 167 transitions. [2023-12-25 07:08:41,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-25 07:08:41,770 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:41,770 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:41,777 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 (6)] Ended with exit code 0 [2023-12-25 07:08:41,973 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-25 07:08:41,974 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:41,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:41,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1877030088, now seen corresponding path program 1 times [2023-12-25 07:08:41,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:41,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852665052] [2023-12-25 07:08:41,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:41,974 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-25 07:08:41,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:41,976 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-25 07:08:41,978 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-25 07:08:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:42,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:08:42,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:42,075 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 07:08:42,075 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:08:42,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:42,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852665052] [2023-12-25 07:08:42,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [852665052] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:08:42,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:08:42,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:08:42,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226875831] [2023-12-25 07:08:42,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:08:42,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:08:42,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:42,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:08:42,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:08:42,077 INFO L87 Difference]: Start difference. First operand 110 states and 167 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 07:08:42,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:42,092 INFO L93 Difference]: Finished difference Result 206 states and 315 transitions. [2023-12-25 07:08:42,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:08:42,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2023-12-25 07:08:42,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:42,093 INFO L225 Difference]: With dead ends: 206 [2023-12-25 07:08:42,093 INFO L226 Difference]: Without dead ends: 110 [2023-12-25 07:08:42,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 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-25 07:08:42,094 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:42,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 119 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:08:42,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-25 07:08:42,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-12-25 07:08:42,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.5591397849462365) internal successors, (145), 94 states have internal predecessors, (145), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-25 07:08:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 166 transitions. [2023-12-25 07:08:42,100 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 166 transitions. Word has length 98 [2023-12-25 07:08:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:42,100 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 166 transitions. [2023-12-25 07:08:42,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 07:08:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 166 transitions. [2023-12-25 07:08:42,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-25 07:08:42,101 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:42,101 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:42,107 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-25 07:08:42,305 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-25 07:08:42,308 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:42,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:42,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1275434742, now seen corresponding path program 1 times [2023-12-25 07:08:42,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:42,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311761318] [2023-12-25 07:08:42,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:42,309 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-25 07:08:42,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:42,313 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-25 07:08:42,314 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-25 07:08:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:42,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 07:08:42,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:42,440 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-25 07:08:42,441 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:08:42,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:42,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311761318] [2023-12-25 07:08:42,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311761318] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:08:42,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:08:42,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:08:42,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24121181] [2023-12-25 07:08:42,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:08:42,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:08:42,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:42,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:08:42,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:08:42,444 INFO L87 Difference]: Start difference. First operand 110 states and 166 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 07:08:42,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:42,605 INFO L93 Difference]: Finished difference Result 312 states and 480 transitions. [2023-12-25 07:08:42,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 07:08:42,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2023-12-25 07:08:42,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:42,607 INFO L225 Difference]: With dead ends: 312 [2023-12-25 07:08:42,607 INFO L226 Difference]: Without dead ends: 218 [2023-12-25 07:08:42,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:08:42,609 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 205 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:42,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 319 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:08:42,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-12-25 07:08:42,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 209. [2023-12-25 07:08:42,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 175 states have (on average 1.5657142857142856) internal successors, (274), 179 states have internal predecessors, (274), 19 states have call successors, (19), 11 states have call predecessors, (19), 14 states have return successors, (27), 20 states have call predecessors, (27), 19 states have call successors, (27) [2023-12-25 07:08:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 320 transitions. [2023-12-25 07:08:42,627 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 320 transitions. Word has length 98 [2023-12-25 07:08:42,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:42,628 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 320 transitions. [2023-12-25 07:08:42,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 07:08:42,628 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 320 transitions. [2023-12-25 07:08:42,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-25 07:08:42,629 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:42,629 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:42,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 07:08:42,833 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-25 07:08:42,833 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:42,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:42,833 INFO L85 PathProgramCache]: Analyzing trace with hash 65992058, now seen corresponding path program 1 times [2023-12-25 07:08:42,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:42,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758318394] [2023-12-25 07:08:42,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:42,834 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-25 07:08:42,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:42,835 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-25 07:08:42,837 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-25 07:08:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:42,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:08:42,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:42,956 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:08:42,956 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:08:42,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:42,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758318394] [2023-12-25 07:08:42,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758318394] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:08:42,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:08:42,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 07:08:42,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869385646] [2023-12-25 07:08:42,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:08:42,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 07:08:42,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:42,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 07:08:42,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:08:42,958 INFO L87 Difference]: Start difference. First operand 209 states and 320 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 07:08:43,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:43,020 INFO L93 Difference]: Finished difference Result 436 states and 678 transitions. [2023-12-25 07:08:43,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 07:08:43,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2023-12-25 07:08:43,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:43,023 INFO L225 Difference]: With dead ends: 436 [2023-12-25 07:08:43,023 INFO L226 Difference]: Without dead ends: 251 [2023-12-25 07:08:43,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-25 07:08:43,025 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 28 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:43,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 597 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:08:43,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-12-25 07:08:43,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 217. [2023-12-25 07:08:43,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 181 states have (on average 1.5469613259668509) internal successors, (280), 185 states have internal predecessors, (280), 19 states have call successors, (19), 11 states have call predecessors, (19), 16 states have return successors, (31), 22 states have call predecessors, (31), 19 states have call successors, (31) [2023-12-25 07:08:43,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 330 transitions. [2023-12-25 07:08:43,043 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 330 transitions. Word has length 98 [2023-12-25 07:08:43,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:43,044 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 330 transitions. [2023-12-25 07:08:43,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 07:08:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 330 transitions. [2023-12-25 07:08:43,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-25 07:08:43,045 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:43,046 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:43,050 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-25 07:08:43,249 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-25 07:08:43,250 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:43,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:43,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1962594052, now seen corresponding path program 1 times [2023-12-25 07:08:43,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:43,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414277630] [2023-12-25 07:08:43,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:43,251 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-25 07:08:43,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:43,252 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-25 07:08:43,253 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-25 07:08:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:43,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:08:43,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 07:08:43,370 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:08:43,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:43,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414277630] [2023-12-25 07:08:43,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1414277630] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:08:43,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:08:43,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:08:43,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303005274] [2023-12-25 07:08:43,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:08:43,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:08:43,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:43,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:08:43,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:08:43,372 INFO L87 Difference]: Start difference. First operand 217 states and 330 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-25 07:08:43,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:43,411 INFO L93 Difference]: Finished difference Result 472 states and 716 transitions. [2023-12-25 07:08:43,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:08:43,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 98 [2023-12-25 07:08:43,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:43,413 INFO L225 Difference]: With dead ends: 472 [2023-12-25 07:08:43,413 INFO L226 Difference]: Without dead ends: 279 [2023-12-25 07:08:43,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 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-25 07:08:43,414 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 53 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:43,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 228 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:08:43,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-12-25 07:08:43,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 247. [2023-12-25 07:08:43,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 198 states have (on average 1.5) internal successors, (297), 203 states have internal predecessors, (297), 27 states have call successors, (27), 15 states have call predecessors, (27), 21 states have return successors, (42), 32 states have call predecessors, (42), 27 states have call successors, (42) [2023-12-25 07:08:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 366 transitions. [2023-12-25 07:08:43,427 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 366 transitions. Word has length 98 [2023-12-25 07:08:43,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:43,427 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 366 transitions. [2023-12-25 07:08:43,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-25 07:08:43,427 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 366 transitions. [2023-12-25 07:08:43,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-25 07:08:43,428 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:43,428 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:43,445 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-25 07:08:43,645 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-25 07:08:43,645 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:43,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:43,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1600405818, now seen corresponding path program 1 times [2023-12-25 07:08:43,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:43,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1476407611] [2023-12-25 07:08:43,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:43,646 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-25 07:08:43,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:43,649 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-25 07:08:43,650 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-25 07:08:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:43,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:08:43,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-25 07:08:43,730 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:08:43,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:43,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1476407611] [2023-12-25 07:08:43,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1476407611] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:08:43,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:08:43,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:08:43,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908744514] [2023-12-25 07:08:43,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:08:43,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:08:43,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:43,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:08:43,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:08:43,731 INFO L87 Difference]: Start difference. First operand 247 states and 366 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 07:08:43,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:43,768 INFO L93 Difference]: Finished difference Result 468 states and 699 transitions. [2023-12-25 07:08:43,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:08:43,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2023-12-25 07:08:43,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:43,770 INFO L225 Difference]: With dead ends: 468 [2023-12-25 07:08:43,770 INFO L226 Difference]: Without dead ends: 255 [2023-12-25 07:08:43,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:08:43,771 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 2 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:43,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 349 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:08:43,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-12-25 07:08:43,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 251. [2023-12-25 07:08:43,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 202 states have (on average 1.49009900990099) internal successors, (301), 207 states have internal predecessors, (301), 27 states have call successors, (27), 15 states have call predecessors, (27), 21 states have return successors, (42), 32 states have call predecessors, (42), 27 states have call successors, (42) [2023-12-25 07:08:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 370 transitions. [2023-12-25 07:08:43,786 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 370 transitions. Word has length 98 [2023-12-25 07:08:43,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:43,786 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 370 transitions. [2023-12-25 07:08:43,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 07:08:43,786 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 370 transitions. [2023-12-25 07:08:43,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-25 07:08:43,787 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:43,787 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:43,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-25 07:08:43,991 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-25 07:08:43,991 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:43,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:43,992 INFO L85 PathProgramCache]: Analyzing trace with hash -713756377, now seen corresponding path program 1 times [2023-12-25 07:08:43,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:43,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183250471] [2023-12-25 07:08:43,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:43,992 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-25 07:08:43,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:43,993 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-25 07:08:44,004 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-25 07:08:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:44,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:08:44,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 07:08:44,074 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:08:44,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:44,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183250471] [2023-12-25 07:08:44,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183250471] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:08:44,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:08:44,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:08:44,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021401963] [2023-12-25 07:08:44,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:08:44,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:08:44,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:44,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:08:44,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:08:44,076 INFO L87 Difference]: Start difference. First operand 251 states and 370 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-25 07:08:44,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:44,106 INFO L93 Difference]: Finished difference Result 504 states and 769 transitions. [2023-12-25 07:08:44,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:08:44,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 101 [2023-12-25 07:08:44,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:44,108 INFO L225 Difference]: With dead ends: 504 [2023-12-25 07:08:44,108 INFO L226 Difference]: Without dead ends: 285 [2023-12-25 07:08:44,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 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-25 07:08:44,109 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 16 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:44,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 231 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:08:44,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-12-25 07:08:44,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2023-12-25 07:08:44,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 224 states have (on average 1.4732142857142858) internal successors, (330), 229 states have internal predecessors, (330), 35 states have call successors, (35), 19 states have call predecessors, (35), 25 states have return successors, (60), 40 states have call predecessors, (60), 35 states have call successors, (60) [2023-12-25 07:08:44,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 425 transitions. [2023-12-25 07:08:44,122 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 425 transitions. Word has length 101 [2023-12-25 07:08:44,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:44,123 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 425 transitions. [2023-12-25 07:08:44,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-25 07:08:44,123 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 425 transitions. [2023-12-25 07:08:44,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-25 07:08:44,124 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:44,124 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:44,127 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 (12)] Ended with exit code 0 [2023-12-25 07:08:44,327 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-25 07:08:44,327 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:44,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:44,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1856258843, now seen corresponding path program 1 times [2023-12-25 07:08:44,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:44,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828024914] [2023-12-25 07:08:44,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:44,328 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-25 07:08:44,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:44,330 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-25 07:08:44,340 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-25 07:08:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:44,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:08:44,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:44,450 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-25 07:08:44,451 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:08:44,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:44,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828024914] [2023-12-25 07:08:44,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828024914] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:08:44,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:08:44,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:08:44,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800165306] [2023-12-25 07:08:44,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:08:44,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:08:44,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:44,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:08:44,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:08:44,452 INFO L87 Difference]: Start difference. First operand 285 states and 425 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-25 07:08:44,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:44,586 INFO L93 Difference]: Finished difference Result 631 states and 951 transitions. [2023-12-25 07:08:44,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 07:08:44,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 101 [2023-12-25 07:08:44,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:44,588 INFO L225 Difference]: With dead ends: 631 [2023-12-25 07:08:44,588 INFO L226 Difference]: Without dead ends: 378 [2023-12-25 07:08:44,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 97 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-25 07:08:44,589 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 72 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:44,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 453 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:08:44,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2023-12-25 07:08:44,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 364. [2023-12-25 07:08:44,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 291 states have (on average 1.4604810996563573) internal successors, (425), 302 states have internal predecessors, (425), 39 states have call successors, (39), 21 states have call predecessors, (39), 33 states have return successors, (76), 44 states have call predecessors, (76), 39 states have call successors, (76) [2023-12-25 07:08:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 540 transitions. [2023-12-25 07:08:44,628 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 540 transitions. Word has length 101 [2023-12-25 07:08:44,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:44,629 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 540 transitions. [2023-12-25 07:08:44,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-25 07:08:44,629 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 540 transitions. [2023-12-25 07:08:44,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-25 07:08:44,630 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:44,630 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:44,636 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 (13)] Ended with exit code 0 [2023-12-25 07:08:44,834 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-25 07:08:44,834 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:44,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:44,835 INFO L85 PathProgramCache]: Analyzing trace with hash 532305187, now seen corresponding path program 1 times [2023-12-25 07:08:44,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:44,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845260575] [2023-12-25 07:08:44,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:44,835 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-25 07:08:44,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:44,836 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-25 07:08:44,862 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-25 07:08:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:44,909 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:08:44,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:45,001 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 07:08:45,001 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:08:45,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:45,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845260575] [2023-12-25 07:08:45,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845260575] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:08:45,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:08:45,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:08:45,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33743011] [2023-12-25 07:08:45,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:08:45,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:08:45,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:45,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:08:45,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:08:45,003 INFO L87 Difference]: Start difference. First operand 364 states and 540 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 07:08:45,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:45,096 INFO L93 Difference]: Finished difference Result 666 states and 986 transitions. [2023-12-25 07:08:45,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:08:45,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2023-12-25 07:08:45,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:45,098 INFO L225 Difference]: With dead ends: 666 [2023-12-25 07:08:45,098 INFO L226 Difference]: Without dead ends: 332 [2023-12-25 07:08:45,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 97 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-25 07:08:45,100 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 2 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:45,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 302 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:08:45,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-12-25 07:08:45,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2023-12-25 07:08:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 269 states have (on average 1.4758364312267658) internal successors, (397), 278 states have internal predecessors, (397), 31 states have call successors, (31), 21 states have call predecessors, (31), 31 states have return successors, (55), 34 states have call predecessors, (55), 31 states have call successors, (55) [2023-12-25 07:08:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 483 transitions. [2023-12-25 07:08:45,120 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 483 transitions. Word has length 101 [2023-12-25 07:08:45,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:45,120 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 483 transitions. [2023-12-25 07:08:45,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 07:08:45,120 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 483 transitions. [2023-12-25 07:08:45,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-25 07:08:45,121 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:45,122 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:45,140 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 (14)] Forceful destruction successful, exit code 0 [2023-12-25 07:08:45,325 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-25 07:08:45,325 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:45,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:45,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1035392478, now seen corresponding path program 1 times [2023-12-25 07:08:45,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:45,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243441532] [2023-12-25 07:08:45,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:45,326 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-25 07:08:45,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:45,327 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:08:45,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-25 07:08:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:45,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:08:45,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:45,489 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 07:08:45,489 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:08:45,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:45,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243441532] [2023-12-25 07:08:45,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [243441532] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:08:45,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:08:45,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:08:45,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448013823] [2023-12-25 07:08:45,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:08:45,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:08:45,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:45,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:08:45,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:08:45,491 INFO L87 Difference]: Start difference. First operand 332 states and 483 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-25 07:08:45,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:45,536 INFO L93 Difference]: Finished difference Result 593 states and 868 transitions. [2023-12-25 07:08:45,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:08:45,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 114 [2023-12-25 07:08:45,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:45,537 INFO L225 Difference]: With dead ends: 593 [2023-12-25 07:08:45,537 INFO L226 Difference]: Without dead ends: 295 [2023-12-25 07:08:45,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:08:45,538 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 210 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:45,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 120 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:08:45,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-12-25 07:08:45,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2023-12-25 07:08:45,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 237 states have (on average 1.4556962025316456) internal successors, (345), 243 states have internal predecessors, (345), 29 states have call successors, (29), 21 states have call predecessors, (29), 28 states have return successors, (49), 32 states have call predecessors, (49), 29 states have call successors, (49) [2023-12-25 07:08:45,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 423 transitions. [2023-12-25 07:08:45,551 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 423 transitions. Word has length 114 [2023-12-25 07:08:45,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:45,551 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 423 transitions. [2023-12-25 07:08:45,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-25 07:08:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 423 transitions. [2023-12-25 07:08:45,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-25 07:08:45,553 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:45,553 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:45,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-25 07:08:45,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:08:45,756 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:45,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:45,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1973920713, now seen corresponding path program 1 times [2023-12-25 07:08:45,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:45,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039430799] [2023-12-25 07:08:45,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:45,757 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-25 07:08:45,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:45,758 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:08:45,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-25 07:08:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:45,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:08:45,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 07:08:45,918 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:08:45,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:45,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039430799] [2023-12-25 07:08:45,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039430799] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:08:45,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:08:45,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:08:45,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617329221] [2023-12-25 07:08:45,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:08:45,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:08:45,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:45,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:08:45,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:08:45,920 INFO L87 Difference]: Start difference. First operand 295 states and 423 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-25 07:08:45,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:45,975 INFO L93 Difference]: Finished difference Result 554 states and 802 transitions. [2023-12-25 07:08:45,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:08:45,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 115 [2023-12-25 07:08:45,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:45,977 INFO L225 Difference]: With dead ends: 554 [2023-12-25 07:08:45,977 INFO L226 Difference]: Without dead ends: 295 [2023-12-25 07:08:45,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:08:45,979 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 212 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:45,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 133 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:08:45,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-12-25 07:08:45,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2023-12-25 07:08:45,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 237 states have (on average 1.4388185654008439) internal successors, (341), 243 states have internal predecessors, (341), 29 states have call successors, (29), 21 states have call predecessors, (29), 28 states have return successors, (49), 32 states have call predecessors, (49), 29 states have call successors, (49) [2023-12-25 07:08:46,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 419 transitions. [2023-12-25 07:08:46,014 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 419 transitions. Word has length 115 [2023-12-25 07:08:46,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:46,014 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 419 transitions. [2023-12-25 07:08:46,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-25 07:08:46,015 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 419 transitions. [2023-12-25 07:08:46,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-25 07:08:46,016 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:46,016 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:46,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-25 07:08:46,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:08:46,220 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:46,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:46,221 INFO L85 PathProgramCache]: Analyzing trace with hash -233652776, now seen corresponding path program 1 times [2023-12-25 07:08:46,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:46,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110195556] [2023-12-25 07:08:46,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:46,221 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-25 07:08:46,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:46,222 INFO L229 MonitoredProcess]: Starting monitored process 17 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-25 07:08:46,235 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 (17)] Waiting until timeout for monitored process [2023-12-25 07:08:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:46,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:08:46,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:46,303 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 07:08:46,304 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:08:46,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:46,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110195556] [2023-12-25 07:08:46,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110195556] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:08:46,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:08:46,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:08:46,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786727008] [2023-12-25 07:08:46,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:08:46,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:08:46,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:46,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:08:46,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:08:46,305 INFO L87 Difference]: Start difference. First operand 295 states and 419 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-25 07:08:46,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:46,338 INFO L93 Difference]: Finished difference Result 562 states and 804 transitions. [2023-12-25 07:08:46,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:08:46,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2023-12-25 07:08:46,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:46,340 INFO L225 Difference]: With dead ends: 562 [2023-12-25 07:08:46,340 INFO L226 Difference]: Without dead ends: 303 [2023-12-25 07:08:46,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 114 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-25 07:08:46,341 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 6 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:46,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 219 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:08:46,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-25 07:08:46,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2023-12-25 07:08:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 243 states have (on average 1.4279835390946503) internal successors, (347), 249 states have internal predecessors, (347), 29 states have call successors, (29), 21 states have call predecessors, (29), 28 states have return successors, (49), 32 states have call predecessors, (49), 29 states have call successors, (49) [2023-12-25 07:08:46,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 425 transitions. [2023-12-25 07:08:46,354 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 425 transitions. Word has length 116 [2023-12-25 07:08:46,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:46,354 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 425 transitions. [2023-12-25 07:08:46,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-25 07:08:46,355 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 425 transitions. [2023-12-25 07:08:46,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-25 07:08:46,355 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:46,355 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:46,369 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 (17)] Forceful destruction successful, exit code 0 [2023-12-25 07:08:46,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-25 07:08:46,559 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:46,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:46,560 INFO L85 PathProgramCache]: Analyzing trace with hash 891435924, now seen corresponding path program 1 times [2023-12-25 07:08:46,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:46,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443728871] [2023-12-25 07:08:46,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:46,560 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-25 07:08:46,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:46,561 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:08:46,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-25 07:08:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:46,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:08:46,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 07:08:46,719 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:08:46,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:46,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443728871] [2023-12-25 07:08:46,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443728871] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:08:46,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:08:46,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:08:46,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629177315] [2023-12-25 07:08:46,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:08:46,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:08:46,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:46,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:08:46,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:08:46,720 INFO L87 Difference]: Start difference. First operand 301 states and 425 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-25 07:08:46,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:46,759 INFO L93 Difference]: Finished difference Result 558 states and 790 transitions. [2023-12-25 07:08:46,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:08:46,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 117 [2023-12-25 07:08:46,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:46,761 INFO L225 Difference]: With dead ends: 558 [2023-12-25 07:08:46,761 INFO L226 Difference]: Without dead ends: 293 [2023-12-25 07:08:46,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:08:46,762 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 167 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:46,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 115 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:08:46,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2023-12-25 07:08:46,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2023-12-25 07:08:46,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 235 states have (on average 1.3914893617021276) internal successors, (327), 241 states have internal predecessors, (327), 29 states have call successors, (29), 21 states have call predecessors, (29), 28 states have return successors, (49), 32 states have call predecessors, (49), 29 states have call successors, (49) [2023-12-25 07:08:46,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 405 transitions. [2023-12-25 07:08:46,777 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 405 transitions. Word has length 117 [2023-12-25 07:08:46,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:46,777 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 405 transitions. [2023-12-25 07:08:46,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-25 07:08:46,777 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 405 transitions. [2023-12-25 07:08:46,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-25 07:08:46,778 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:46,778 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:46,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-25 07:08:46,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:08:46,982 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:46,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:46,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1601488889, now seen corresponding path program 1 times [2023-12-25 07:08:46,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:46,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322239881] [2023-12-25 07:08:46,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:46,983 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-25 07:08:46,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:46,984 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:08:46,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-25 07:08:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:47,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:08:47,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:47,065 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 07:08:47,065 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:08:47,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:47,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322239881] [2023-12-25 07:08:47,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322239881] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:08:47,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:08:47,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:08:47,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584809619] [2023-12-25 07:08:47,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:08:47,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:08:47,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:47,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:08:47,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:08:47,067 INFO L87 Difference]: Start difference. First operand 293 states and 405 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-25 07:08:47,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:47,097 INFO L93 Difference]: Finished difference Result 566 states and 782 transitions. [2023-12-25 07:08:47,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:08:47,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 118 [2023-12-25 07:08:47,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:47,099 INFO L225 Difference]: With dead ends: 566 [2023-12-25 07:08:47,099 INFO L226 Difference]: Without dead ends: 309 [2023-12-25 07:08:47,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 116 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-25 07:08:47,100 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 5 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:47,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 218 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:08:47,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-12-25 07:08:47,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 301. [2023-12-25 07:08:47,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 243 states have (on average 1.3786008230452675) internal successors, (335), 249 states have internal predecessors, (335), 29 states have call successors, (29), 21 states have call predecessors, (29), 28 states have return successors, (49), 32 states have call predecessors, (49), 29 states have call successors, (49) [2023-12-25 07:08:47,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 413 transitions. [2023-12-25 07:08:47,116 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 413 transitions. Word has length 118 [2023-12-25 07:08:47,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:47,116 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 413 transitions. [2023-12-25 07:08:47,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-25 07:08:47,116 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 413 transitions. [2023-12-25 07:08:47,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-25 07:08:47,117 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:47,117 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:47,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 (19)] Forceful destruction successful, exit code 0 [2023-12-25 07:08:47,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:08:47,321 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:47,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:47,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1040789111, now seen corresponding path program 1 times [2023-12-25 07:08:47,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:47,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196697505] [2023-12-25 07:08:47,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:47,323 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-25 07:08:47,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:47,324 INFO L229 MonitoredProcess]: Starting monitored process 20 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-25 07:08:47,325 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 (20)] Waiting until timeout for monitored process [2023-12-25 07:08:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:47,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:08:47,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:47,428 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 07:08:47,428 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:08:47,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:47,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196697505] [2023-12-25 07:08:47,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196697505] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:08:47,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:08:47,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:08:47,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979416077] [2023-12-25 07:08:47,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:08:47,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:08:47,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:47,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:08:47,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:08:47,429 INFO L87 Difference]: Start difference. First operand 301 states and 413 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-25 07:08:47,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:47,475 INFO L93 Difference]: Finished difference Result 574 states and 788 transitions. [2023-12-25 07:08:47,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:08:47,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 118 [2023-12-25 07:08:47,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:47,477 INFO L225 Difference]: With dead ends: 574 [2023-12-25 07:08:47,477 INFO L226 Difference]: Without dead ends: 309 [2023-12-25 07:08:47,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 116 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-25 07:08:47,478 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:47,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 218 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:08:47,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-12-25 07:08:47,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2023-12-25 07:08:47,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 249 states have (on average 1.3694779116465863) internal successors, (341), 255 states have internal predecessors, (341), 29 states have call successors, (29), 21 states have call predecessors, (29), 28 states have return successors, (49), 32 states have call predecessors, (49), 29 states have call successors, (49) [2023-12-25 07:08:47,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 419 transitions. [2023-12-25 07:08:47,492 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 419 transitions. Word has length 118 [2023-12-25 07:08:47,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:47,492 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 419 transitions. [2023-12-25 07:08:47,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-25 07:08:47,492 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 419 transitions. [2023-12-25 07:08:47,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-25 07:08:47,493 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:47,493 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:47,497 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 (20)] Forceful destruction successful, exit code 0 [2023-12-25 07:08:47,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-25 07:08:47,697 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:47,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:47,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1081463861, now seen corresponding path program 1 times [2023-12-25 07:08:47,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:47,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477509290] [2023-12-25 07:08:47,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:47,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-25 07:08:47,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:47,699 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:08:47,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-25 07:08:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:47,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:08:47,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:08:47,820 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:08:47,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:47,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477509290] [2023-12-25 07:08:47,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477509290] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:08:47,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:08:47,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:08:47,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891029545] [2023-12-25 07:08:47,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:08:47,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:08:47,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:47,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:08:47,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:08:47,822 INFO L87 Difference]: Start difference. First operand 307 states and 419 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-25 07:08:47,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:47,992 INFO L93 Difference]: Finished difference Result 686 states and 932 transitions. [2023-12-25 07:08:47,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 07:08:47,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 118 [2023-12-25 07:08:47,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:47,994 INFO L225 Difference]: With dead ends: 686 [2023-12-25 07:08:47,994 INFO L226 Difference]: Without dead ends: 415 [2023-12-25 07:08:47,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 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-25 07:08:47,995 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 98 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:47,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 297 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:08:47,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2023-12-25 07:08:48,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 379. [2023-12-25 07:08:48,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 309 states have (on average 1.3559870550161812) internal successors, (419), 317 states have internal predecessors, (419), 35 states have call successors, (35), 27 states have call predecessors, (35), 34 states have return successors, (61), 36 states have call predecessors, (61), 35 states have call successors, (61) [2023-12-25 07:08:48,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 515 transitions. [2023-12-25 07:08:48,017 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 515 transitions. Word has length 118 [2023-12-25 07:08:48,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:48,017 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 515 transitions. [2023-12-25 07:08:48,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-25 07:08:48,017 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 515 transitions. [2023-12-25 07:08:48,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-25 07:08:48,018 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:48,018 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:48,024 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 (21)] Ended with exit code 0 [2023-12-25 07:08:48,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:08:48,222 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:48,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:48,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1606366733, now seen corresponding path program 1 times [2023-12-25 07:08:48,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:48,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123313442] [2023-12-25 07:08:48,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:48,223 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-25 07:08:48,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:48,224 INFO L229 MonitoredProcess]: Starting monitored process 22 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-25 07:08:48,249 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 (22)] Waiting until timeout for monitored process [2023-12-25 07:08:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:48,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 07:08:48,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 41 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:08:48,441 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:08:48,594 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-25 07:08:48,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:48,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123313442] [2023-12-25 07:08:48,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123313442] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:08:48,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:08:48,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2023-12-25 07:08:48,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928331910] [2023-12-25 07:08:48,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:08:48,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 07:08:48,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:48,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 07:08:48,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-12-25 07:08:48,596 INFO L87 Difference]: Start difference. First operand 379 states and 515 transitions. Second operand has 11 states, 11 states have (on average 13.454545454545455) internal successors, (148), 11 states have internal predecessors, (148), 4 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2023-12-25 07:08:48,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:48,943 INFO L93 Difference]: Finished difference Result 975 states and 1319 transitions. [2023-12-25 07:08:48,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 07:08:48,944 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.454545454545455) internal successors, (148), 11 states have internal predecessors, (148), 4 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 120 [2023-12-25 07:08:48,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:48,946 INFO L225 Difference]: With dead ends: 975 [2023-12-25 07:08:48,946 INFO L226 Difference]: Without dead ends: 620 [2023-12-25 07:08:48,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-12-25 07:08:48,947 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 548 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:48,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 420 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 07:08:48,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2023-12-25 07:08:48,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 572. [2023-12-25 07:08:48,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 473 states have (on average 1.3509513742071881) internal successors, (639), 483 states have internal predecessors, (639), 49 states have call successors, (49), 41 states have call predecessors, (49), 49 states have return successors, (81), 48 states have call predecessors, (81), 49 states have call successors, (81) [2023-12-25 07:08:48,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 769 transitions. [2023-12-25 07:08:48,978 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 769 transitions. Word has length 120 [2023-12-25 07:08:48,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:48,979 INFO L495 AbstractCegarLoop]: Abstraction has 572 states and 769 transitions. [2023-12-25 07:08:48,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.454545454545455) internal successors, (148), 11 states have internal predecessors, (148), 4 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2023-12-25 07:08:48,979 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 769 transitions. [2023-12-25 07:08:48,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-25 07:08:48,980 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:48,980 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:48,984 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 (22)] Forceful destruction successful, exit code 0 [2023-12-25 07:08:49,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-25 07:08:49,184 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:49,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:49,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1607658677, now seen corresponding path program 1 times [2023-12-25 07:08:49,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:49,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401419621] [2023-12-25 07:08:49,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:49,185 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-25 07:08:49,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:49,186 INFO L229 MonitoredProcess]: Starting monitored process 23 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-25 07:08:49,211 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 (23)] Waiting until timeout for monitored process [2023-12-25 07:08:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:49,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:08:49,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:49,325 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 07:08:49,325 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:08:49,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:08:49,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401419621] [2023-12-25 07:08:49,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401419621] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:08:49,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:08:49,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:08:49,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204451411] [2023-12-25 07:08:49,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:08:49,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:08:49,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:08:49,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:08:49,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:08:49,326 INFO L87 Difference]: Start difference. First operand 572 states and 769 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-25 07:08:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:49,382 INFO L93 Difference]: Finished difference Result 730 states and 983 transitions. [2023-12-25 07:08:49,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:08:49,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 120 [2023-12-25 07:08:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:49,382 INFO L225 Difference]: With dead ends: 730 [2023-12-25 07:08:49,382 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 07:08:49,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:08:49,383 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 181 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:49,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 124 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:08:49,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 07:08:49,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 07:08:49,384 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-25 07:08:49,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 07:08:49,384 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2023-12-25 07:08:49,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:49,384 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 07:08:49,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-25 07:08:49,384 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 07:08:49,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 07:08:49,386 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 07:08:49,400 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 (23)] Forceful destruction successful, exit code 0 [2023-12-25 07:08:49,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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-25 07:08:49,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 07:08:50,679 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 383 398) the Hoare annotation is: true [2023-12-25 07:08:50,680 INFO L899 garLoopResultBuilder]: For program point L129(lines 106 131) no Hoare annotation was computed. [2023-12-25 07:08:50,680 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 124) no Hoare annotation was computed. [2023-12-25 07:08:50,680 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 125) no Hoare annotation was computed. [2023-12-25 07:08:50,680 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 126) no Hoare annotation was computed. [2023-12-25 07:08:50,680 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 127) no Hoare annotation was computed. [2023-12-25 07:08:50,680 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 383 398) no Hoare annotation was computed. [2023-12-25 07:08:50,680 INFO L899 garLoopResultBuilder]: For program point L390(lines 390 394) no Hoare annotation was computed. [2023-12-25 07:08:50,680 INFO L899 garLoopResultBuilder]: For program point L390-2(lines 383 398) no Hoare annotation was computed. [2023-12-25 07:08:50,680 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 264 278) no Hoare annotation was computed. [2023-12-25 07:08:50,680 INFO L899 garLoopResultBuilder]: For program point L268(lines 268 273) no Hoare annotation was computed. [2023-12-25 07:08:50,680 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 264 278) the Hoare annotation is: true [2023-12-25 07:08:50,680 INFO L899 garLoopResultBuilder]: For program point L275(lines 267 277) no Hoare annotation was computed. [2023-12-25 07:08:50,682 INFO L899 garLoopResultBuilder]: For program point L341-1(lines 317 349) no Hoare annotation was computed. [2023-12-25 07:08:50,683 INFO L899 garLoopResultBuilder]: For program point L331-1(lines 320 348) no Hoare annotation was computed. [2023-12-25 07:08:50,683 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 317 349) the Hoare annotation is: (or (not (= ~z_val_t~0 (_ bv0 32))) (not (= ~d0_val_t~0 (_ bv1 32))) (not (= ~b0_val~0 (_ bv1 32))) (not (= (_ bv2 32) |old(~z_ev~0)|)) (not (= ~z_val~0 (_ bv0 32))) (not (= ~b1_val~0 (_ bv1 32))) (not (= ~comp_m1_i~0 (_ bv0 32))) (not (= ~d1_val_t~0 (_ bv1 32))) (not (= ~d0_val~0 (_ bv1 32))) (and (= (_ bv2 32) ~z_ev~0) (= |old(~b0_ev~0)| ~b0_ev~0)) (not (= ~b0_val_t~0 (_ bv1 32))) (not (= ~d1_val~0 (_ bv1 32))) (not (= (_ bv1 32) ~b1_val_t~0))) [2023-12-25 07:08:50,683 INFO L899 garLoopResultBuilder]: For program point L321-1(lines 320 348) no Hoare annotation was computed. [2023-12-25 07:08:50,683 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 317 349) no Hoare annotation was computed. [2023-12-25 07:08:50,683 INFO L899 garLoopResultBuilder]: For program point L336-1(lines 320 348) no Hoare annotation was computed. [2023-12-25 07:08:50,683 INFO L899 garLoopResultBuilder]: For program point L326-1(lines 320 348) no Hoare annotation was computed. [2023-12-25 07:08:50,683 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 202) no Hoare annotation was computed. [2023-12-25 07:08:50,683 INFO L899 garLoopResultBuilder]: For program point L197-2(lines 197 202) no Hoare annotation was computed. [2023-12-25 07:08:50,683 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 211 249) no Hoare annotation was computed. [2023-12-25 07:08:50,684 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 157) no Hoare annotation was computed. [2023-12-25 07:08:50,684 INFO L899 garLoopResultBuilder]: For program point L152-2(lines 152 157) no Hoare annotation was computed. [2023-12-25 07:08:50,684 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 208 250) no Hoare annotation was computed. [2023-12-25 07:08:50,684 INFO L899 garLoopResultBuilder]: For program point L219-1(lines 211 249) no Hoare annotation was computed. [2023-12-25 07:08:50,684 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 187) no Hoare annotation was computed. [2023-12-25 07:08:50,684 INFO L899 garLoopResultBuilder]: For program point L182-2(lines 182 187) no Hoare annotation was computed. [2023-12-25 07:08:50,684 INFO L899 garLoopResultBuilder]: For program point L240-1(lines 208 250) no Hoare annotation was computed. [2023-12-25 07:08:50,684 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 208 250) the Hoare annotation is: (let ((.cse0 (not (= ~z_val_t~0 (_ bv0 32)))) (.cse1 (not (= ~d0_val_t~0 (_ bv1 32)))) (.cse2 (not (= (_ bv2 32) |old(~z_ev~0)|))) (.cse3 (not (= ~comp_m1_i~0 (_ bv0 32)))) (.cse8 (not (= ~d1_val_t~0 (_ bv1 32)))) (.cse4 (= (_ bv2 32) ~z_ev~0)) (.cse5 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse6 (= ~z_val~0 (_ bv0 32))) (.cse7 (= |old(~b0_ev~0)| ~b0_ev~0)) (.cse9 (not (= |old(~z_val~0)| (_ bv0 32)))) (.cse10 (not (= ~b0_val_t~0 (_ bv1 32)))) (.cse11 (not (= (_ bv1 32) ~b1_val_t~0)))) (and (or .cse0 .cse1 (not (= ~comp_m1_st~0 (_ bv0 32))) .cse2 (not (= |old(~b0_req_up~0)| (_ bv1 32))) .cse3 (and (= ~b0_val~0 (_ bv0 32)) .cse4 .cse5 .cse6 (= ~b1_req_up~0 (_ bv1 32)) (= ~d1_req_up~0 (_ bv1 32)) (= ~b0_req_up~0 (_ bv1 32)) .cse7 (= ~d0_req_up~0 (_ bv1 32))) .cse8 (not (= |old(~d0_req_up~0)| (_ bv1 32))) .cse9 (not (= |old(~d1_req_up~0)| (_ bv1 32))) .cse10 (not (= |old(~b1_req_up~0)| (_ bv1 32))) .cse11 (not (= |old(~b0_val~0)| (_ bv0 32)))) (or .cse0 .cse1 (not (= |old(~b0_val~0)| (_ bv1 32))) (not (= |old(~b1_val~0)| (_ bv1 32))) .cse2 (not (= (_ bv1 32) |old(~d0_val~0)|)) .cse3 .cse8 (and (= ~d0_req_up~0 |old(~d0_req_up~0)|) .cse4 .cse5 .cse6 (= ~d1_val~0 (_ bv1 32)) (= |old(~b0_req_up~0)| ~b0_req_up~0) (= ~b0_val~0 (_ bv1 32)) .cse7 (= |old(~b1_req_up~0)| ~b1_req_up~0) (= |old(~d1_req_up~0)| ~d1_req_up~0) (= ~b1_val~0 (_ bv1 32)) (= ~d0_val~0 (_ bv1 32))) (not (= |old(~d1_val~0)| (_ bv1 32))) .cse9 .cse10 .cse11))) [2023-12-25 07:08:50,684 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 142) no Hoare annotation was computed. [2023-12-25 07:08:50,684 INFO L899 garLoopResultBuilder]: For program point L137-2(lines 137 142) no Hoare annotation was computed. [2023-12-25 07:08:50,684 INFO L899 garLoopResultBuilder]: For program point L212-1(lines 211 249) no Hoare annotation was computed. [2023-12-25 07:08:50,684 INFO L899 garLoopResultBuilder]: For program point L233-1(lines 211 249) no Hoare annotation was computed. [2023-12-25 07:08:50,684 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 172) no Hoare annotation was computed. [2023-12-25 07:08:50,685 INFO L899 garLoopResultBuilder]: For program point L167-2(lines 167 172) no Hoare annotation was computed. [2023-12-25 07:08:50,685 INFO L899 garLoopResultBuilder]: For program point L374-1(lines 350 382) no Hoare annotation was computed. [2023-12-25 07:08:50,685 INFO L899 garLoopResultBuilder]: For program point L364-1(lines 353 381) no Hoare annotation was computed. [2023-12-25 07:08:50,685 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 350 382) the Hoare annotation is: (or (not (= ~z_val_t~0 (_ bv0 32))) (not (= ~d0_val_t~0 (_ bv1 32))) (not (= ~b0_val~0 (_ bv1 32))) (not (= (_ bv2 32) |old(~z_ev~0)|)) (not (= ~z_val~0 (_ bv0 32))) (not (= ~b1_val~0 (_ bv1 32))) (not (= ~comp_m1_i~0 (_ bv0 32))) (not (= ~d1_val_t~0 (_ bv1 32))) (not (= ~d0_val~0 (_ bv1 32))) (and (= (_ bv2 32) ~z_ev~0) (= |old(~b0_ev~0)| ~b0_ev~0)) (not (= ~b0_val_t~0 (_ bv1 32))) (not (= ~d1_val~0 (_ bv1 32))) (not (= (_ bv1 32) ~b1_val_t~0))) [2023-12-25 07:08:50,685 INFO L899 garLoopResultBuilder]: For program point L354-1(lines 353 381) no Hoare annotation was computed. [2023-12-25 07:08:50,685 INFO L899 garLoopResultBuilder]: For program point L369-1(lines 353 381) no Hoare annotation was computed. [2023-12-25 07:08:50,685 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 350 382) no Hoare annotation was computed. [2023-12-25 07:08:50,685 INFO L899 garLoopResultBuilder]: For program point L359-1(lines 353 381) no Hoare annotation was computed. [2023-12-25 07:08:50,685 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (and (= ~b0_val_t~0 (_ bv1 32)) (= (_ bv2 32) ~z_ev~0) (= ~d1_val_t~0 (_ bv1 32)) (= ~z_val~0 (_ bv0 32)) (= ~comp_m1_i~0 (_ bv0 32)) (= ~d1_val~0 (_ bv1 32)) (= ~b0_val~0 (_ bv1 32)) (= ~z_val_t~0 (_ bv0 32)) (= ~d0_val_t~0 (_ bv1 32)) (= (_ bv1 32) ~b1_val_t~0) (= ~b1_val~0 (_ bv1 32)) (= ~d0_val~0 (_ bv1 32))) [2023-12-25 07:08:50,685 INFO L899 garLoopResultBuilder]: For program point L440-1(line 440) no Hoare annotation was computed. [2023-12-25 07:08:50,685 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 412) no Hoare annotation was computed. [2023-12-25 07:08:50,685 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2023-12-25 07:08:50,685 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 51 101) no Hoare annotation was computed. [2023-12-25 07:08:50,685 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-25 07:08:50,685 INFO L895 garLoopResultBuilder]: At program point L432-1(lines 432 454) the Hoare annotation is: (and (= ~b0_val_t~0 (_ bv1 32)) (= (_ bv2 32) ~z_ev~0) (= ~d1_val_t~0 (_ bv1 32)) (= ~z_val~0 (_ bv0 32)) (= ~comp_m1_i~0 (_ bv0 32)) (= ~d1_val~0 (_ bv1 32)) (= ~b0_val~0 (_ bv1 32)) (= ~z_val_t~0 (_ bv0 32)) (= ~d0_val_t~0 (_ bv1 32)) (= (_ bv1 32) ~b1_val_t~0) (= ~b1_val~0 (_ bv1 32)) (= ~d0_val~0 (_ bv1 32))) [2023-12-25 07:08:50,685 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2023-12-25 07:08:50,685 INFO L899 garLoopResultBuilder]: For program point L61(lines 51 101) no Hoare annotation was computed. [2023-12-25 07:08:50,685 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 418 460) no Hoare annotation was computed. [2023-12-25 07:08:50,686 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2023-12-25 07:08:50,686 INFO L895 garLoopResultBuilder]: At program point L425(line 425) the Hoare annotation is: (and (= ~b0_val~0 (_ bv0 32)) (= ~b0_val_t~0 (_ bv1 32)) (= (_ bv2 32) ~z_ev~0) (= ~d1_val_t~0 (_ bv1 32)) (= ~z_val~0 (_ bv0 32)) (= ~b1_req_up~0 (_ bv1 32)) (= ~comp_m1_i~0 (_ bv0 32)) (= ~comp_m1_st~0 (_ bv0 32)) (= ~d1_req_up~0 (_ bv1 32)) (= ~b0_req_up~0 (_ bv1 32)) (= ~z_val_t~0 (_ bv0 32)) (= ~d0_req_up~0 (_ bv1 32)) (= ~d0_val_t~0 (_ bv1 32)) (= (_ bv1 32) ~b1_val_t~0)) [2023-12-25 07:08:50,686 INFO L899 garLoopResultBuilder]: For program point L425-1(line 425) no Hoare annotation was computed. [2023-12-25 07:08:50,686 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 66) no Hoare annotation was computed. [2023-12-25 07:08:50,686 INFO L899 garLoopResultBuilder]: For program point L79(lines 51 101) no Hoare annotation was computed. [2023-12-25 07:08:50,686 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 07:08:50,686 INFO L895 garLoopResultBuilder]: At program point L286(line 286) the Hoare annotation is: (and (= ~b0_val_t~0 (_ bv1 32)) (= (_ bv2 32) ~z_ev~0) (= ~d1_val_t~0 (_ bv1 32)) (= ~z_val~0 (_ bv0 32)) (= ~comp_m1_i~0 (_ bv0 32)) (= ~d1_val~0 (_ bv1 32)) (= ~b0_val~0 (_ bv1 32)) (= ~z_val_t~0 (_ bv0 32)) (= ~d0_val_t~0 (_ bv1 32)) (= (_ bv1 32) ~b1_val_t~0) (= ~b1_val~0 (_ bv1 32)) (= ~d0_val~0 (_ bv1 32))) [2023-12-25 07:08:50,686 INFO L899 garLoopResultBuilder]: For program point L501(lines 501 507) no Hoare annotation was computed. [2023-12-25 07:08:50,686 INFO L899 garLoopResultBuilder]: For program point L501-2(lines 501 507) no Hoare annotation was computed. [2023-12-25 07:08:50,686 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 84) no Hoare annotation was computed. [2023-12-25 07:08:50,686 INFO L895 garLoopResultBuilder]: At program point L427(line 427) the Hoare annotation is: (and (= ~b0_val_t~0 (_ bv1 32)) (= (_ bv2 32) ~z_ev~0) (= ~d1_val_t~0 (_ bv1 32)) (= ~z_val~0 (_ bv0 32)) (= ~b0_ev~0 (_ bv0 32)) (= ~comp_m1_i~0 (_ bv0 32)) (= ~d1_val~0 (_ bv1 32)) (= ~b0_val~0 (_ bv1 32)) (= ~z_val_t~0 (_ bv0 32)) (= ~d0_val_t~0 (_ bv1 32)) (= (_ bv1 32) ~b1_val_t~0) (= ~b1_val~0 (_ bv1 32)) (= ~d0_val~0 (_ bv1 32))) [2023-12-25 07:08:50,686 INFO L895 garLoopResultBuilder]: At program point L427-1(line 427) the Hoare annotation is: (and (= ~b0_ev~0 (_ bv1 32)) (= ~b0_val_t~0 (_ bv1 32)) (= (_ bv2 32) ~z_ev~0) (= ~d1_val_t~0 (_ bv1 32)) (= ~z_val~0 (_ bv0 32)) (= ~comp_m1_i~0 (_ bv0 32)) (= ~d1_val~0 (_ bv1 32)) (= ~b0_val~0 (_ bv1 32)) (= ~z_val_t~0 (_ bv0 32)) (= ~d0_val_t~0 (_ bv1 32)) (= (_ bv1 32) ~b1_val_t~0) (= ~b1_val~0 (_ bv1 32)) (= ~d0_val~0 (_ bv1 32))) [2023-12-25 07:08:50,686 INFO L895 garLoopResultBuilder]: At program point L295(lines 285 310) the Hoare annotation is: (and (= ~b0_val_t~0 (_ bv1 32)) (= (_ bv2 32) ~z_ev~0) (= ~d1_val_t~0 (_ bv1 32)) (= ~z_val~0 (_ bv0 32)) (= ~comp_m1_i~0 (_ bv0 32)) (= ~d1_val~0 (_ bv1 32)) (= ~b0_val~0 (_ bv1 32)) (= ~z_val_t~0 (_ bv0 32)) (= ~d0_val_t~0 (_ bv1 32)) (= (_ bv1 32) ~b1_val_t~0) (= ~b1_val~0 (_ bv1 32)) (= ~d0_val~0 (_ bv1 32))) [2023-12-25 07:08:50,686 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 279 316) no Hoare annotation was computed. [2023-12-25 07:08:50,686 INFO L895 garLoopResultBuilder]: At program point L444(line 444) the Hoare annotation is: (and (= ~b0_val_t~0 (_ bv1 32)) (= (_ bv2 32) ~z_ev~0) (= ~d1_val_t~0 (_ bv1 32)) (= ~z_val~0 (_ bv0 32)) (= ~comp_m1_i~0 (_ bv0 32)) (= ~d1_val~0 (_ bv1 32)) (= ~b0_val~0 (_ bv1 32)) (= ~z_val_t~0 (_ bv0 32)) (= ~d0_val_t~0 (_ bv1 32)) (= (_ bv1 32) ~b1_val_t~0) (= ~b1_val~0 (_ bv1 32)) (= ~d0_val~0 (_ bv1 32))) [2023-12-25 07:08:50,687 INFO L895 garLoopResultBuilder]: At program point L444-1(line 444) the Hoare annotation is: (and (= ~b0_val_t~0 (_ bv1 32)) (= (_ bv2 32) ~z_ev~0) (= ~d1_val_t~0 (_ bv1 32)) (= ~z_val~0 (_ bv0 32)) (= ~comp_m1_i~0 (_ bv0 32)) (= ~d1_val~0 (_ bv1 32)) (= ~b0_val~0 (_ bv1 32)) (= ~z_val_t~0 (_ bv0 32)) (= ~d0_val_t~0 (_ bv1 32)) (= (_ bv1 32) ~b1_val_t~0) (= ~b1_val~0 (_ bv1 32)) (= ~d0_val~0 (_ bv1 32))) [2023-12-25 07:08:50,687 INFO L895 garLoopResultBuilder]: At program point L428(line 428) the Hoare annotation is: (and (= ~b0_ev~0 (_ bv1 32)) (= ~b0_val_t~0 (_ bv1 32)) (= (_ bv2 32) ~z_ev~0) (= ~d1_val_t~0 (_ bv1 32)) (= ~z_val~0 (_ bv0 32)) (= ~comp_m1_i~0 (_ bv0 32)) (= ~d1_val~0 (_ bv1 32)) (= ~comp_m1_st~0 (_ bv0 32)) (= ~b0_val~0 (_ bv1 32)) (= ~z_val_t~0 (_ bv0 32)) (= ~d0_val_t~0 (_ bv1 32)) (= (_ bv1 32) ~b1_val_t~0) (= ~b1_val~0 (_ bv1 32)) (= ~d0_val~0 (_ bv1 32))) [2023-12-25 07:08:50,687 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 77) no Hoare annotation was computed. [2023-12-25 07:08:50,687 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 51 101) no Hoare annotation was computed. [2023-12-25 07:08:50,687 INFO L899 garLoopResultBuilder]: For program point L288(line 288) no Hoare annotation was computed. [2023-12-25 07:08:50,687 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 259) no Hoare annotation was computed. [2023-12-25 07:08:50,687 INFO L899 garLoopResultBuilder]: For program point L255-2(lines 251 263) no Hoare annotation was computed. [2023-12-25 07:08:50,687 INFO L895 garLoopResultBuilder]: At program point L445(line 445) the Hoare annotation is: (and (= ~b0_val_t~0 (_ bv1 32)) (= (_ bv2 32) ~z_ev~0) (= ~d1_val_t~0 (_ bv1 32)) (= ~z_val~0 (_ bv0 32)) (= ~comp_m1_i~0 (_ bv0 32)) (= ~d1_val~0 (_ bv1 32)) (= ~b0_val~0 (_ bv1 32)) (= ~z_val_t~0 (_ bv0 32)) (= ~d0_val_t~0 (_ bv1 32)) (= (_ bv1 32) ~b1_val_t~0) (= ~b1_val~0 (_ bv1 32)) (= ~d0_val~0 (_ bv1 32))) [2023-12-25 07:08:50,687 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-25 07:08:50,687 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 07:08:50,687 INFO L899 garLoopResultBuilder]: For program point L446(line 446) no Hoare annotation was computed. [2023-12-25 07:08:50,687 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2023-12-25 07:08:50,687 INFO L899 garLoopResultBuilder]: For program point L91-2(lines 88 96) no Hoare annotation was computed. [2023-12-25 07:08:50,687 INFO L895 garLoopResultBuilder]: At program point L405(line 405) the Hoare annotation is: (and (= ~b0_val_t~0 (_ bv1 32)) (= (_ bv2 32) ~z_ev~0) (= ~d1_val_t~0 (_ bv1 32)) (= ~z_val~0 (_ bv0 32)) (= ~comp_m1_i~0 (_ bv0 32)) (= ~d1_val~0 (_ bv1 32)) (= ~b0_val~0 (_ bv1 32)) (= ~z_val_t~0 (_ bv0 32)) (= ~d0_val_t~0 (_ bv1 32)) (= (_ bv1 32) ~b1_val_t~0) (= ~b1_val~0 (_ bv1 32)) (= ~d0_val~0 (_ bv1 32))) [2023-12-25 07:08:50,687 INFO L899 garLoopResultBuilder]: For program point L405-1(line 405) no Hoare annotation was computed. [2023-12-25 07:08:50,687 INFO L899 garLoopResultBuilder]: For program point L290(lines 290 294) no Hoare annotation was computed. [2023-12-25 07:08:50,687 INFO L899 garLoopResultBuilder]: For program point L290-1(lines 285 310) no Hoare annotation was computed. [2023-12-25 07:08:50,688 INFO L899 garLoopResultBuilder]: For program point L414(lines 403 416) no Hoare annotation was computed. [2023-12-25 07:08:50,688 INFO L899 garLoopResultBuilder]: For program point L299(lines 299 306) no Hoare annotation was computed. [2023-12-25 07:08:50,690 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:50,691 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 07:08:50,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 07:08:50 BoogieIcfgContainer [2023-12-25 07:08:50,704 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 07:08:50,705 INFO L158 Benchmark]: Toolchain (without parser) took 12380.19ms. Allocated memory was 302.0MB in the beginning and 436.2MB in the end (delta: 134.2MB). Free memory was 246.8MB in the beginning and 257.8MB in the end (delta: -11.1MB). Peak memory consumption was 191.6MB. Max. memory is 8.0GB. [2023-12-25 07:08:50,705 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 222.3MB. Free memory is still 171.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 07:08:50,705 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.15ms. Allocated memory is still 302.0MB. Free memory was 246.5MB in the beginning and 232.3MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 07:08:50,706 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.38ms. Allocated memory is still 302.0MB. Free memory was 232.3MB in the beginning and 230.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 07:08:50,706 INFO L158 Benchmark]: Boogie Preprocessor took 62.39ms. Allocated memory is still 302.0MB. Free memory was 230.2MB in the beginning and 227.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 07:08:50,706 INFO L158 Benchmark]: RCFGBuilder took 558.65ms. Allocated memory is still 302.0MB. Free memory was 227.6MB in the beginning and 254.2MB in the end (delta: -26.6MB). Peak memory consumption was 17.4MB. Max. memory is 8.0GB. [2023-12-25 07:08:50,706 INFO L158 Benchmark]: TraceAbstraction took 11532.49ms. Allocated memory was 302.0MB in the beginning and 436.2MB in the end (delta: 134.2MB). Free memory was 253.2MB in the beginning and 257.8MB in the end (delta: -4.7MB). Peak memory consumption was 198.3MB. Max. memory is 8.0GB. [2023-12-25 07:08:50,710 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 222.3MB. Free memory is still 171.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 191.15ms. Allocated memory is still 302.0MB. Free memory was 246.5MB in the beginning and 232.3MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.38ms. Allocated memory is still 302.0MB. Free memory was 232.3MB in the beginning and 230.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.39ms. Allocated memory is still 302.0MB. Free memory was 230.2MB in the beginning and 227.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 558.65ms. Allocated memory is still 302.0MB. Free memory was 227.6MB in the beginning and 254.2MB in the end (delta: -26.6MB). Peak memory consumption was 17.4MB. Max. memory is 8.0GB. * TraceAbstraction took 11532.49ms. Allocated memory was 302.0MB in the beginning and 436.2MB in the end (delta: 134.2MB). Free memory was 253.2MB in the beginning and 257.8MB in the end (delta: -4.7MB). Peak memory consumption was 198.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: 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 6 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 22, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2221 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2201 mSDsluCounter, 5650 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3238 mSDsCounter, 254 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2140 IncrementalHoareTripleChecker+Invalid, 2394 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 254 mSolverCounterUnsat, 2412 mSDtfsCounter, 2140 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2375 GetRequests, 2304 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=572occurred in iteration=21, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 237 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 453 PreInvPairs, 476 NumberOfFragments, 748 HoareAnnotationTreeSize, 453 FormulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 17 FormulaSimplificationsInter, 1704 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2260 NumberOfCodeBlocks, 2260 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2357 ConstructedInterpolants, 0 QuantifiedInterpolants, 4001 SizeOfPredicates, 6 NumberOfNonLiveVariables, 6156 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 23 InterpolantComputations, 21 PerfectInterpolantSequences, 789/802 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: 285]: Loop Invariant Derived loop invariant: ((((((((((((b0_val_t == 1) && (2 == z_ev)) && (d1_val_t == 1)) && (z_val == 0)) && (comp_m1_i == 0)) && (d1_val == 1)) && (b0_val == 1)) && (z_val_t == 0)) && (d0_val_t == 1)) && (1 == b1_val_t)) && (b1_val == 1)) && (d0_val == 1)) - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: ((((((((((((b0_val_t == 1) && (2 == z_ev)) && (d1_val_t == 1)) && (z_val == 0)) && (comp_m1_i == 0)) && (d1_val == 1)) && (b0_val == 1)) && (z_val_t == 0)) && (d0_val_t == 1)) && (1 == b1_val_t)) && (b1_val == 1)) && (d0_val == 1)) RESULT: Ultimate proved your program to be correct! [2023-12-25 07:08:50,740 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...