/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/eca-rers2012/Problem01_label00.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 08:21:31,321 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 08:21:31,399 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 08:21:31,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 08:21:31,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 08:21:31,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 08:21:31,426 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 08:21:31,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 08:21:31,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 08:21:31,429 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 08:21:31,429 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 08:21:31,429 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 08:21:31,430 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 08:21:31,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 08:21:31,431 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 08:21:31,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 08:21:31,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 08:21:31,432 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 08:21:31,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 08:21:31,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 08:21:31,433 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 08:21:31,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 08:21:31,433 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 08:21:31,433 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 08:21:31,434 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 08:21:31,434 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 08:21:31,434 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 08:21:31,434 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 08:21:31,434 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 08:21:31,434 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 08:21:31,435 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 08:21:31,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 08:21:31,435 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 08:21:31,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 08:21:31,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 08:21:31,436 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 08:21:31,436 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 08:21:31,436 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 08:21:31,436 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 08:21:31,436 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 08:21:31,437 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 08:21:31,437 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 08:21:31,437 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 08:21:31,437 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 08:21:31,437 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 08:21:31,437 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 08:21:31,437 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 08:21:31,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 08:21:31,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 08:21:31,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 08:21:31,652 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 08:21:31,652 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 08:21:31,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label00.c [2023-12-16 08:21:32,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 08:21:32,880 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 08:21:32,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label00.c [2023-12-16 08:21:32,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e77f5802/55d89b9c67ea4796ab6affb80f99f240/FLAG66ac7beca [2023-12-16 08:21:32,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e77f5802/55d89b9c67ea4796ab6affb80f99f240 [2023-12-16 08:21:32,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 08:21:32,906 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 08:21:32,907 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 08:21:32,907 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 08:21:32,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 08:21:32,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:21:32" (1/1) ... [2023-12-16 08:21:32,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e4a1bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:32, skipping insertion in model container [2023-12-16 08:21:32,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:21:32" (1/1) ... [2023-12-16 08:21:32,955 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 08:21:33,195 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label00.c[18976,18989] [2023-12-16 08:21:33,213 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 08:21:33,224 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 08:21:33,277 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label00.c[18976,18989] [2023-12-16 08:21:33,291 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 08:21:33,302 INFO L206 MainTranslator]: Completed translation [2023-12-16 08:21:33,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:33 WrapperNode [2023-12-16 08:21:33,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 08:21:33,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 08:21:33,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 08:21:33,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 08:21:33,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:33" (1/1) ... [2023-12-16 08:21:33,320 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:33" (1/1) ... [2023-12-16 08:21:33,362 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 656 [2023-12-16 08:21:33,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 08:21:33,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 08:21:33,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 08:21:33,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 08:21:33,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:33" (1/1) ... [2023-12-16 08:21:33,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:33" (1/1) ... [2023-12-16 08:21:33,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:33" (1/1) ... [2023-12-16 08:21:33,404 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-16 08:21:33,404 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:33" (1/1) ... [2023-12-16 08:21:33,404 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:33" (1/1) ... [2023-12-16 08:21:33,430 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:33" (1/1) ... [2023-12-16 08:21:33,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:33" (1/1) ... [2023-12-16 08:21:33,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:33" (1/1) ... [2023-12-16 08:21:33,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:33" (1/1) ... [2023-12-16 08:21:33,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 08:21:33,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 08:21:33,462 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 08:21:33,462 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 08:21:33,462 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:33" (1/1) ... [2023-12-16 08:21:33,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 08:21:33,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 08:21:33,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 08:21:33,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 08:21:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 08:21:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 08:21:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 08:21:33,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 08:21:33,590 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 08:21:33,593 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 08:21:34,487 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 08:21:34,543 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 08:21:34,543 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 08:21:34,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:21:34 BoogieIcfgContainer [2023-12-16 08:21:34,544 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 08:21:34,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 08:21:34,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 08:21:34,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 08:21:34,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 08:21:32" (1/3) ... [2023-12-16 08:21:34,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181959e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:21:34, skipping insertion in model container [2023-12-16 08:21:34,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:33" (2/3) ... [2023-12-16 08:21:34,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181959e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:21:34, skipping insertion in model container [2023-12-16 08:21:34,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:21:34" (3/3) ... [2023-12-16 08:21:34,552 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label00.c [2023-12-16 08:21:34,564 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 08:21:34,564 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 08:21:34,613 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 08:21:34,618 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;@4848c838, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 08:21:34,618 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 08:21:34,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 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-16 08:21:34,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-16 08:21:34,633 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:21:34,633 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:21:34,634 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:21:34,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:21:34,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1300205520, now seen corresponding path program 1 times [2023-12-16 08:21:34,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:21:34,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936310799] [2023-12-16 08:21:34,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:21:34,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:21:34,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:21:34,653 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 08:21:34,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 08:21:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:21:34,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 08:21:34,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:21:34,784 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-16 08:21:34,785 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:21:34,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:21:34,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936310799] [2023-12-16 08:21:34,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936310799] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:21:34,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:21:34,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 08:21:34,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892392864] [2023-12-16 08:21:34,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:21:34,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 08:21:34,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:21:34,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 08:21:34,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 08:21:34,822 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 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) Second operand has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 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-16 08:21:34,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:21:34,875 INFO L93 Difference]: Finished difference Result 271 states and 529 transitions. [2023-12-16 08:21:34,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 08:21:34,877 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 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) Word has length 107 [2023-12-16 08:21:34,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:21:34,883 INFO L225 Difference]: With dead ends: 271 [2023-12-16 08:21:34,884 INFO L226 Difference]: Without dead ends: 134 [2023-12-16 08:21:34,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 08:21:34,890 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 08:21:34,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 08:21:34,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-16 08:21:34,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-12-16 08:21:34,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 133 states have internal predecessors, (200), 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-16 08:21:34,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions. [2023-12-16 08:21:34,917 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 107 [2023-12-16 08:21:34,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:21:34,917 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 200 transitions. [2023-12-16 08:21:34,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 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-16 08:21:34,918 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions. [2023-12-16 08:21:34,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-16 08:21:34,919 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:21:34,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:21:34,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 08:21:35,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:21:35,124 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:21:35,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:21:35,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1856648641, now seen corresponding path program 1 times [2023-12-16 08:21:35,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:21:35,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96855013] [2023-12-16 08:21:35,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:21:35,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:21:35,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:21:35,127 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 08:21:35,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 08:21:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:21:35,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 08:21:35,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:21:40,923 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-16 08:21:40,923 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:21:40,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:21:40,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96855013] [2023-12-16 08:21:40,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96855013] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:21:40,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:21:40,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 08:21:40,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370540991] [2023-12-16 08:21:40,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:21:40,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 08:21:40,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:21:40,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 08:21:40,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-12-16 08:21:40,926 INFO L87 Difference]: Start difference. First operand 134 states and 200 transitions. Second operand has 10 states, 10 states have (on average 10.7) internal successors, (107), 9 states have internal predecessors, (107), 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-16 08:21:42,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:21:42,019 INFO L93 Difference]: Finished difference Result 587 states and 909 transitions. [2023-12-16 08:21:42,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 08:21:42,019 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 9 states have internal predecessors, (107), 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) Word has length 107 [2023-12-16 08:21:42,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:21:42,025 INFO L225 Difference]: With dead ends: 587 [2023-12-16 08:21:42,025 INFO L226 Difference]: Without dead ends: 454 [2023-12-16 08:21:42,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-12-16 08:21:42,026 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 470 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 08:21:42,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 22 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 08:21:42,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2023-12-16 08:21:42,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2023-12-16 08:21:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 1.3664459161147904) internal successors, (619), 453 states have internal predecessors, (619), 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-16 08:21:42,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 619 transitions. [2023-12-16 08:21:42,044 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 619 transitions. Word has length 107 [2023-12-16 08:21:42,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:21:42,044 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 619 transitions. [2023-12-16 08:21:42,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 9 states have internal predecessors, (107), 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-16 08:21:42,044 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 619 transitions. [2023-12-16 08:21:42,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-16 08:21:42,047 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:21:42,047 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 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-16 08:21:42,051 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 (3)] Ended with exit code 0 [2023-12-16 08:21:42,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:21:42,249 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:21:42,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:21:42,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1696958334, now seen corresponding path program 1 times [2023-12-16 08:21:42,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:21:42,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918969819] [2023-12-16 08:21:42,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:21:42,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-16 08:21:42,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:21:42,252 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 08:21:42,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 08:21:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:21:42,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 08:21:42,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:21:42,458 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:21:42,458 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:21:42,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:21:42,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918969819] [2023-12-16 08:21:42,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918969819] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:21:42,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:21:42,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:21:42,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832337249] [2023-12-16 08:21:42,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:21:42,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 08:21:42,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:21:42,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 08:21:42,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 08:21:42,461 INFO L87 Difference]: Start difference. First operand 454 states and 619 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 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-16 08:21:42,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:21:42,933 INFO L93 Difference]: Finished difference Result 983 states and 1310 transitions. [2023-12-16 08:21:42,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 08:21:42,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 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) Word has length 122 [2023-12-16 08:21:42,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:21:42,935 INFO L225 Difference]: With dead ends: 983 [2023-12-16 08:21:42,935 INFO L226 Difference]: Without dead ends: 457 [2023-12-16 08:21:42,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 08:21:42,937 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 249 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 08:21:42,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 76 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 08:21:42,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2023-12-16 08:21:42,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 454. [2023-12-16 08:21:42,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 1.3311258278145695) internal successors, (603), 453 states have internal predecessors, (603), 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-16 08:21:42,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 603 transitions. [2023-12-16 08:21:42,951 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 603 transitions. Word has length 122 [2023-12-16 08:21:42,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:21:42,951 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 603 transitions. [2023-12-16 08:21:42,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 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-16 08:21:42,951 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 603 transitions. [2023-12-16 08:21:42,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 08:21:42,953 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:21:42,953 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 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-16 08:21:42,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 08:21:43,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:21:43,158 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:21:43,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:21:43,158 INFO L85 PathProgramCache]: Analyzing trace with hash -893215162, now seen corresponding path program 1 times [2023-12-16 08:21:43,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:21:43,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106837430] [2023-12-16 08:21:43,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:21:43,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:21:43,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:21:43,161 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 08:21:43,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 08:21:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:21:43,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 08:21:43,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:21:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:21:43,264 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:21:43,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:21:43,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106837430] [2023-12-16 08:21:43,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [106837430] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:21:43,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:21:43,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:21:43,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635754790] [2023-12-16 08:21:43,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:21:43,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:21:43,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:21:43,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:21:43,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:21:43,266 INFO L87 Difference]: Start difference. First operand 454 states and 603 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-16 08:21:43,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:21:43,704 INFO L93 Difference]: Finished difference Result 1111 states and 1482 transitions. [2023-12-16 08:21:43,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:21:43,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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) Word has length 126 [2023-12-16 08:21:43,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:21:43,707 INFO L225 Difference]: With dead ends: 1111 [2023-12-16 08:21:43,707 INFO L226 Difference]: Without dead ends: 716 [2023-12-16 08:21:43,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:21:43,708 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 121 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 08:21:43,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 64 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 08:21:43,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2023-12-16 08:21:43,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2023-12-16 08:21:43,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.234965034965035) internal successors, (883), 715 states have internal predecessors, (883), 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-16 08:21:43,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 883 transitions. [2023-12-16 08:21:43,727 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 883 transitions. Word has length 126 [2023-12-16 08:21:43,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:21:43,727 INFO L495 AbstractCegarLoop]: Abstraction has 716 states and 883 transitions. [2023-12-16 08:21:43,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-16 08:21:43,727 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 883 transitions. [2023-12-16 08:21:43,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-16 08:21:43,730 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:21:43,730 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:21:43,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 08:21:43,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:21:43,951 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:21:43,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:21:43,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1818516171, now seen corresponding path program 1 times [2023-12-16 08:21:43,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:21:43,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259450526] [2023-12-16 08:21:43,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:21:43,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:21:43,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:21:43,953 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 08:21:43,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 08:21:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:21:44,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 08:21:44,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:21:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:21:44,028 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:21:44,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:21:44,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259450526] [2023-12-16 08:21:44,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259450526] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:21:44,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:21:44,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:21:44,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497212433] [2023-12-16 08:21:44,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:21:44,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:21:44,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:21:44,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:21:44,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:21:44,030 INFO L87 Difference]: Start difference. First operand 716 states and 883 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-16 08:21:44,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:21:44,460 INFO L93 Difference]: Finished difference Result 1766 states and 2234 transitions. [2023-12-16 08:21:44,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:21:44,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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) Word has length 129 [2023-12-16 08:21:44,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:21:44,463 INFO L225 Difference]: With dead ends: 1766 [2023-12-16 08:21:44,463 INFO L226 Difference]: Without dead ends: 1109 [2023-12-16 08:21:44,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:21:44,464 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 127 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 08:21:44,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 183 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 08:21:44,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2023-12-16 08:21:44,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2023-12-16 08:21:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 1108 states have (on average 1.2012635379061372) internal successors, (1331), 1108 states have internal predecessors, (1331), 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-16 08:21:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1331 transitions. [2023-12-16 08:21:44,479 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1331 transitions. Word has length 129 [2023-12-16 08:21:44,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:21:44,480 INFO L495 AbstractCegarLoop]: Abstraction has 1109 states and 1331 transitions. [2023-12-16 08:21:44,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-16 08:21:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1331 transitions. [2023-12-16 08:21:44,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-16 08:21:44,482 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:21:44,482 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 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-16 08:21:44,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 08:21:44,685 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-16 08:21:44,685 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:21:44,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:21:44,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1122188487, now seen corresponding path program 1 times [2023-12-16 08:21:44,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:21:44,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663366543] [2023-12-16 08:21:44,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:21:44,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:21:44,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:21:44,687 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 08:21:44,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 08:21:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:21:44,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 08:21:44,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:21:44,750 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 08:21:44,751 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:21:44,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:21:44,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663366543] [2023-12-16 08:21:44,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663366543] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:21:44,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:21:44,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:21:44,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381662707] [2023-12-16 08:21:44,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:21:44,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:21:44,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:21:44,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:21:44,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:21:44,752 INFO L87 Difference]: Start difference. First operand 1109 states and 1331 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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-16 08:21:45,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:21:45,109 INFO L93 Difference]: Finished difference Result 2290 states and 2753 transitions. [2023-12-16 08:21:45,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:21:45,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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) Word has length 134 [2023-12-16 08:21:45,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:21:45,113 INFO L225 Difference]: With dead ends: 2290 [2023-12-16 08:21:45,113 INFO L226 Difference]: Without dead ends: 1240 [2023-12-16 08:21:45,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:21:45,114 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 170 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 08:21:45,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 27 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 08:21:45,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2023-12-16 08:21:45,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1109. [2023-12-16 08:21:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 1108 states have (on average 1.1471119133574008) internal successors, (1271), 1108 states have internal predecessors, (1271), 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-16 08:21:45,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1271 transitions. [2023-12-16 08:21:45,133 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1271 transitions. Word has length 134 [2023-12-16 08:21:45,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:21:45,134 INFO L495 AbstractCegarLoop]: Abstraction has 1109 states and 1271 transitions. [2023-12-16 08:21:45,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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-16 08:21:45,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1271 transitions. [2023-12-16 08:21:45,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-16 08:21:45,135 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:21:45,135 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 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-16 08:21: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 (7)] Forceful destruction successful, exit code 0 [2023-12-16 08:21:45,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:21:45,340 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:21:45,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:21:45,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1490460701, now seen corresponding path program 1 times [2023-12-16 08:21:45,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:21:45,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899304236] [2023-12-16 08:21:45,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:21:45,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:21:45,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:21:45,342 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 08:21:45,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 08:21:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:21:45,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 08:21:45,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:21:45,438 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 08:21:45,438 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:21:45,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:21:45,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899304236] [2023-12-16 08:21:45,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899304236] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:21:45,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:21:45,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:21:45,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243242108] [2023-12-16 08:21:45,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:21:45,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:21:45,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:21:45,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:21:45,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:21:45,440 INFO L87 Difference]: Start difference. First operand 1109 states and 1271 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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-16 08:21:45,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:21:45,813 INFO L93 Difference]: Finished difference Result 2421 states and 2788 transitions. [2023-12-16 08:21:45,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:21:45,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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) Word has length 137 [2023-12-16 08:21:45,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:21:45,817 INFO L225 Difference]: With dead ends: 2421 [2023-12-16 08:21:45,817 INFO L226 Difference]: Without dead ends: 1240 [2023-12-16 08:21:45,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:21:45,819 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 08:21:45,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 131 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 08:21:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2023-12-16 08:21:45,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1240. [2023-12-16 08:21:45,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 1239 states have (on average 1.073446327683616) internal successors, (1330), 1239 states have internal predecessors, (1330), 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-16 08:21:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1330 transitions. [2023-12-16 08:21:45,835 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1330 transitions. Word has length 137 [2023-12-16 08:21:45,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:21:45,835 INFO L495 AbstractCegarLoop]: Abstraction has 1240 states and 1330 transitions. [2023-12-16 08:21:45,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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-16 08:21:45,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1330 transitions. [2023-12-16 08:21:45,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-16 08:21:45,836 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:21:45,837 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, 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, 1, 1, 1, 1] [2023-12-16 08:21:45,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 08:21:46,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:21:46,041 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:21:46,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:21:46,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2067502087, now seen corresponding path program 1 times [2023-12-16 08:21:46,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:21:46,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150298753] [2023-12-16 08:21:46,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:21:46,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:21:46,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:21:46,044 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 08:21:46,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 08:21:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:21:46,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 08:21:46,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:21:47,629 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:21:47,630 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:21:47,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:21:47,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150298753] [2023-12-16 08:21:47,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150298753] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:21:47,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:21:47,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 08:21:47,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83871220] [2023-12-16 08:21:47,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:21:47,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 08:21:47,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:21:47,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 08:21:47,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2023-12-16 08:21:47,632 INFO L87 Difference]: Start difference. First operand 1240 states and 1330 transitions. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 9 states have internal predecessors, (144), 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-16 08:21:48,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:21:48,354 INFO L93 Difference]: Finished difference Result 2474 states and 2659 transitions. [2023-12-16 08:21:48,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 08:21:48,355 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 9 states have internal predecessors, (144), 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) Word has length 144 [2023-12-16 08:21:48,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:21:48,357 INFO L225 Difference]: With dead ends: 2474 [2023-12-16 08:21:48,358 INFO L226 Difference]: Without dead ends: 1276 [2023-12-16 08:21:48,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2023-12-16 08:21:48,361 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 119 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 08:21:48,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 45 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 08:21:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2023-12-16 08:21:48,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1275. [2023-12-16 08:21:48,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 1274 states have (on average 1.0729984301412874) internal successors, (1367), 1274 states have internal predecessors, (1367), 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-16 08:21:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1367 transitions. [2023-12-16 08:21:48,376 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1367 transitions. Word has length 144 [2023-12-16 08:21:48,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:21:48,376 INFO L495 AbstractCegarLoop]: Abstraction has 1275 states and 1367 transitions. [2023-12-16 08:21:48,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 9 states have internal predecessors, (144), 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-16 08:21:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1367 transitions. [2023-12-16 08:21:48,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-12-16 08:21:48,379 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:21:48,379 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-16 08:21:48,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-16 08:21:48,599 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-16 08:21:48,599 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:21:48,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:21:48,600 INFO L85 PathProgramCache]: Analyzing trace with hash 245141949, now seen corresponding path program 1 times [2023-12-16 08:21:48,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:21:48,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583993444] [2023-12-16 08:21:48,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:21:48,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:21:48,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:21:48,609 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 08:21:48,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 08:21:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:21:48,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 08:21:48,676 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:21:48,814 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 08:21:48,814 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:21:48,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:21:48,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583993444] [2023-12-16 08:21:48,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583993444] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:21:48,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:21:48,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:21:48,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636221692] [2023-12-16 08:21:48,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:21:48,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 08:21:48,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:21:48,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 08:21:48,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 08:21:48,816 INFO L87 Difference]: Start difference. First operand 1275 states and 1367 transitions. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 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-16 08:21:49,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:21:49,295 INFO L93 Difference]: Finished difference Result 2884 states and 3105 transitions. [2023-12-16 08:21:49,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 08:21:49,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 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) Word has length 187 [2023-12-16 08:21:49,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:21:49,299 INFO L225 Difference]: With dead ends: 2884 [2023-12-16 08:21:49,299 INFO L226 Difference]: Without dead ends: 1537 [2023-12-16 08:21:49,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 08:21:49,301 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 211 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 08:21:49,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 31 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 08:21:49,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2023-12-16 08:21:49,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1537. [2023-12-16 08:21:49,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1536 states have (on average 1.0703125) internal successors, (1644), 1536 states have internal predecessors, (1644), 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-16 08:21:49,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 1644 transitions. [2023-12-16 08:21:49,321 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 1644 transitions. Word has length 187 [2023-12-16 08:21:49,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:21:49,321 INFO L495 AbstractCegarLoop]: Abstraction has 1537 states and 1644 transitions. [2023-12-16 08:21:49,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 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-16 08:21:49,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 1644 transitions. [2023-12-16 08:21:49,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2023-12-16 08:21:49,324 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:21:49,324 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1] [2023-12-16 08:21:49,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 08:21:49,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:21:49,526 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:21:49,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:21:49,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1225833814, now seen corresponding path program 1 times [2023-12-16 08:21:49,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:21:49,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744317493] [2023-12-16 08:21:49,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:21:49,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:21:49,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:21:49,529 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 08:21:49,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-16 08:21:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:21:49,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 08:21:49,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:21:49,837 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 118 proven. 35 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 08:21:49,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 08:21:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 118 proven. 35 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 08:21:50,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:21:50,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744317493] [2023-12-16 08:21:50,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744317493] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 08:21:50,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 08:21:50,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 08:21:50,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179499456] [2023-12-16 08:21:50,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 08:21:50,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 08:21:50,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:21:50,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 08:21:50,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-16 08:21:50,100 INFO L87 Difference]: Start difference. First operand 1537 states and 1644 transitions. Second operand has 7 states, 7 states have (on average 32.42857142857143) internal successors, (227), 6 states have internal predecessors, (227), 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-16 08:21:50,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:21:50,787 INFO L93 Difference]: Finished difference Result 3157 states and 3393 transitions. [2023-12-16 08:21:50,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 08:21:50,788 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.42857142857143) internal successors, (227), 6 states have internal predecessors, (227), 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) Word has length 203 [2023-12-16 08:21:50,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:21:50,791 INFO L225 Difference]: With dead ends: 3157 [2023-12-16 08:21:50,791 INFO L226 Difference]: Without dead ends: 1679 [2023-12-16 08:21:50,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-12-16 08:21:50,793 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 464 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 08:21:50,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 48 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 08:21:50,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2023-12-16 08:21:50,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1668. [2023-12-16 08:21:50,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1667 states have (on average 1.0671865626874626) internal successors, (1779), 1667 states have internal predecessors, (1779), 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-16 08:21:50,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 1779 transitions. [2023-12-16 08:21:50,812 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 1779 transitions. Word has length 203 [2023-12-16 08:21:50,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:21:50,812 INFO L495 AbstractCegarLoop]: Abstraction has 1668 states and 1779 transitions. [2023-12-16 08:21:50,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.42857142857143) internal successors, (227), 6 states have internal predecessors, (227), 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-16 08:21:50,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 1779 transitions. [2023-12-16 08:21:50,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-12-16 08:21:50,815 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:21:50,815 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-16 08:21:50,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-16 08:21:51,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:21:51,017 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:21:51,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:21:51,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2119543080, now seen corresponding path program 1 times [2023-12-16 08:21:51,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:21:51,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1986614209] [2023-12-16 08:21:51,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:21:51,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:21:51,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:21:51,020 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-16 08:21:51,024 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-16 08:21:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:21:51,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 08:21:51,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:21:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 161 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-16 08:21:52,027 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 08:21:53,519 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 110 proven. 52 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-16 08:21:53,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:21:53,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1986614209] [2023-12-16 08:21:53,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1986614209] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 08:21:53,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 08:21:53,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-16 08:21:53,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473214642] [2023-12-16 08:21:53,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 08:21:53,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 08:21:53,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:21:53,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 08:21:53,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-16 08:21:53,522 INFO L87 Difference]: Start difference. First operand 1668 states and 1779 transitions. Second operand has 9 states, 9 states have (on average 29.77777777777778) internal successors, (268), 8 states have internal predecessors, (268), 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-16 08:21:55,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:21:55,466 INFO L93 Difference]: Finished difference Result 5161 states and 5556 transitions. [2023-12-16 08:21:55,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-16 08:21:55,467 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 29.77777777777778) internal successors, (268), 8 states have internal predecessors, (268), 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) Word has length 209 [2023-12-16 08:21:55,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:21:55,474 INFO L225 Difference]: With dead ends: 5161 [2023-12-16 08:21:55,474 INFO L226 Difference]: Without dead ends: 3552 [2023-12-16 08:21:55,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2023-12-16 08:21:55,476 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 1439 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 2435 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1439 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 2435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-16 08:21:55,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1439 Valid, 97 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 2435 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-16 08:21:55,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3552 states. [2023-12-16 08:21:55,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3552 to 1799. [2023-12-16 08:21:55,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1798 states have (on average 1.0734149054505007) internal successors, (1930), 1798 states have internal predecessors, (1930), 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-16 08:21:55,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 1930 transitions. [2023-12-16 08:21:55,501 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 1930 transitions. Word has length 209 [2023-12-16 08:21:55,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:21:55,501 INFO L495 AbstractCegarLoop]: Abstraction has 1799 states and 1930 transitions. [2023-12-16 08:21:55,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.77777777777778) internal successors, (268), 8 states have internal predecessors, (268), 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-16 08:21:55,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 1930 transitions. [2023-12-16 08:21:55,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2023-12-16 08:21:55,504 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:21:55,504 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-16 08:21:55,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-16 08:21:55,706 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-16 08:21:55,706 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:21:55,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:21:55,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1091582248, now seen corresponding path program 1 times [2023-12-16 08:21:55,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:21:55,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16064907] [2023-12-16 08:21:55,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:21:55,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:21:55,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:21:55,709 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 08:21:55,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-16 08:21:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:21:55,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 08:21:55,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:21:55,969 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-16 08:21:55,970 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:21:55,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:21:55,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16064907] [2023-12-16 08:21:55,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16064907] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:21:55,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:21:55,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:21:55,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588022370] [2023-12-16 08:21:55,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:21:55,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 08:21:55,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:21:55,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 08:21:55,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 08:21:55,971 INFO L87 Difference]: Start difference. First operand 1799 states and 1930 transitions. Second operand has 4 states, 4 states have (on average 48.5) internal successors, (194), 3 states have internal predecessors, (194), 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-16 08:21:56,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:21:56,474 INFO L93 Difference]: Finished difference Result 3801 states and 4090 transitions. [2023-12-16 08:21:56,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 08:21:56,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 3 states have internal predecessors, (194), 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) Word has length 241 [2023-12-16 08:21:56,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:21:56,477 INFO L225 Difference]: With dead ends: 3801 [2023-12-16 08:21:56,477 INFO L226 Difference]: Without dead ends: 1109 [2023-12-16 08:21:56,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 08:21:56,479 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 202 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 08:21:56,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 34 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 08:21:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2023-12-16 08:21:56,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2023-12-16 08:21:56,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 1108 states have (on average 1.032490974729242) internal successors, (1144), 1108 states have internal predecessors, (1144), 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-16 08:21:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1144 transitions. [2023-12-16 08:21:56,490 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1144 transitions. Word has length 241 [2023-12-16 08:21:56,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:21:56,490 INFO L495 AbstractCegarLoop]: Abstraction has 1109 states and 1144 transitions. [2023-12-16 08:21:56,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 3 states have internal predecessors, (194), 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-16 08:21:56,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1144 transitions. [2023-12-16 08:21:56,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2023-12-16 08:21:56,492 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:21:56,493 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-16 08:21:56,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-16 08:21:56,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:21:56,695 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:21:56,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:21:56,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1874856044, now seen corresponding path program 1 times [2023-12-16 08:21:56,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:21:56,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155041579] [2023-12-16 08:21:56,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:21:56,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:21:56,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:21:56,697 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-16 08:21:56,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-16 08:21:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:21:56,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 08:21:56,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:21:57,503 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 152 proven. 42 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-16 08:21:57,504 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 08:21:58,325 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 152 proven. 42 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-16 08:21:58,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:21:58,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155041579] [2023-12-16 08:21:58,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155041579] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 08:21:58,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 08:21:58,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 08:21:58,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114328770] [2023-12-16 08:21:58,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 08:21:58,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 08:21:58,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:21:58,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 08:21:58,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-16 08:21:58,327 INFO L87 Difference]: Start difference. First operand 1109 states and 1144 transitions. Second operand has 7 states, 7 states have (on average 38.285714285714285) internal successors, (268), 6 states have internal predecessors, (268), 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-16 08:21:59,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:21:59,324 INFO L93 Difference]: Finished difference Result 2692 states and 2775 transitions. [2023-12-16 08:21:59,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 08:21:59,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 38.285714285714285) internal successors, (268), 6 states have internal predecessors, (268), 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) Word has length 243 [2023-12-16 08:21:59,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:21:59,328 INFO L225 Difference]: With dead ends: 2692 [2023-12-16 08:21:59,328 INFO L226 Difference]: Without dead ends: 1642 [2023-12-16 08:21:59,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 479 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-16 08:21:59,330 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 598 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-16 08:21:59,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 65 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-16 08:21:59,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2023-12-16 08:21:59,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1109. [2023-12-16 08:21:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 1108 states have (on average 1.032490974729242) internal successors, (1144), 1108 states have internal predecessors, (1144), 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-16 08:21:59,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1144 transitions. [2023-12-16 08:21:59,341 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1144 transitions. Word has length 243 [2023-12-16 08:21:59,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:21:59,341 INFO L495 AbstractCegarLoop]: Abstraction has 1109 states and 1144 transitions. [2023-12-16 08:21:59,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.285714285714285) internal successors, (268), 6 states have internal predecessors, (268), 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-16 08:21:59,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1144 transitions. [2023-12-16 08:21:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2023-12-16 08:21:59,343 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:21:59,344 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 08:21:59,348 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-16 08:21:59,546 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-16 08:21:59,546 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:21:59,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:21:59,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1178317670, now seen corresponding path program 1 times [2023-12-16 08:21:59,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:21:59,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201177500] [2023-12-16 08:21:59,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:21:59,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:21:59,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:21:59,549 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-16 08:21:59,574 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-16 08:21:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:21:59,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 08:21:59,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:22:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2023-12-16 08:22:00,240 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:22:00,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:22:00,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [201177500] [2023-12-16 08:22:00,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [201177500] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:22:00,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:22:00,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 08:22:00,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501682732] [2023-12-16 08:22:00,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:22:00,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 08:22:00,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:22:00,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 08:22:00,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 08:22:00,242 INFO L87 Difference]: Start difference. First operand 1109 states and 1144 transitions. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 4 states have internal predecessors, (170), 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-16 08:22:00,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:22:00,735 INFO L93 Difference]: Finished difference Result 2498 states and 2573 transitions. [2023-12-16 08:22:00,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 08:22:00,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 4 states have internal predecessors, (170), 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) Word has length 252 [2023-12-16 08:22:00,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:22:00,736 INFO L225 Difference]: With dead ends: 2498 [2023-12-16 08:22:00,736 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 08:22:00,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 08:22:00,738 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 247 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 08:22:00,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 15 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 08:22:00,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 08:22:00,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 08:22:00,739 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-16 08:22:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 08:22:00,739 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 252 [2023-12-16 08:22:00,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:22:00,739 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 08:22:00,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 4 states have internal predecessors, (170), 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-16 08:22:00,739 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 08:22:00,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 08:22:00,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 08:22:00,743 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 (15)] Ended with exit code 0 [2023-12-16 08:22:00,943 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-16 08:22:00,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 08:22:01,383 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 400) no Hoare annotation was computed. [2023-12-16 08:22:01,384 INFO L899 garLoopResultBuilder]: For program point L598(line 598) no Hoare annotation was computed. [2023-12-16 08:22:01,384 INFO L899 garLoopResultBuilder]: For program point L334(lines 334 400) no Hoare annotation was computed. [2023-12-16 08:22:01,384 INFO L899 garLoopResultBuilder]: For program point L566-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,384 INFO L899 garLoopResultBuilder]: For program point L533-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,384 INFO L899 garLoopResultBuilder]: For program point L500-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,384 INFO L899 garLoopResultBuilder]: For program point L467-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,384 INFO L899 garLoopResultBuilder]: For program point L401(lines 401 403) no Hoare annotation was computed. [2023-12-16 08:22:01,384 INFO L899 garLoopResultBuilder]: For program point L434-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,384 INFO L899 garLoopResultBuilder]: For program point L401-2(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,384 INFO L899 garLoopResultBuilder]: For program point L302(lines 302 400) no Hoare annotation was computed. [2023-12-16 08:22:01,384 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 400) no Hoare annotation was computed. [2023-12-16 08:22:01,384 INFO L899 garLoopResultBuilder]: For program point L204(lines 204 400) no Hoare annotation was computed. [2023-12-16 08:22:01,384 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 400) no Hoare annotation was computed. [2023-12-16 08:22:01,384 INFO L899 garLoopResultBuilder]: For program point L271(lines 271 400) no Hoare annotation was computed. [2023-12-16 08:22:01,384 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 400) no Hoare annotation was computed. [2023-12-16 08:22:01,384 INFO L899 garLoopResultBuilder]: For program point L569-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,384 INFO L899 garLoopResultBuilder]: For program point L536-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,385 INFO L899 garLoopResultBuilder]: For program point L503-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,385 INFO L899 garLoopResultBuilder]: For program point L470-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,385 INFO L899 garLoopResultBuilder]: For program point L437-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,385 INFO L899 garLoopResultBuilder]: For program point L371(lines 371 400) no Hoare annotation was computed. [2023-12-16 08:22:01,385 INFO L899 garLoopResultBuilder]: For program point L404-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,385 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 400) no Hoare annotation was computed. [2023-12-16 08:22:01,385 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 400) no Hoare annotation was computed. [2023-12-16 08:22:01,385 INFO L899 garLoopResultBuilder]: For program point L339(lines 339 400) no Hoare annotation was computed. [2023-12-16 08:22:01,385 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 400) no Hoare annotation was computed. [2023-12-16 08:22:01,385 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 400) no Hoare annotation was computed. [2023-12-16 08:22:01,385 INFO L899 garLoopResultBuilder]: For program point L373(lines 373 400) no Hoare annotation was computed. [2023-12-16 08:22:01,385 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 400) no Hoare annotation was computed. [2023-12-16 08:22:01,385 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 400) no Hoare annotation was computed. [2023-12-16 08:22:01,385 INFO L899 garLoopResultBuilder]: For program point L572-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,385 INFO L899 garLoopResultBuilder]: For program point L539-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,385 INFO L899 garLoopResultBuilder]: For program point L506-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,385 INFO L899 garLoopResultBuilder]: For program point L473-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,385 INFO L899 garLoopResultBuilder]: For program point L440-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,385 INFO L899 garLoopResultBuilder]: For program point L407-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,385 INFO L899 garLoopResultBuilder]: For program point L275(lines 275 400) no Hoare annotation was computed. [2023-12-16 08:22:01,386 INFO L899 garLoopResultBuilder]: For program point L375(lines 375 400) no Hoare annotation was computed. [2023-12-16 08:22:01,386 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 400) no Hoare annotation was computed. [2023-12-16 08:22:01,386 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 400) no Hoare annotation was computed. [2023-12-16 08:22:01,386 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 400) no Hoare annotation was computed. [2023-12-16 08:22:01,386 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 400) no Hoare annotation was computed. [2023-12-16 08:22:01,386 INFO L899 garLoopResultBuilder]: For program point L575-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,386 INFO L899 garLoopResultBuilder]: For program point L542-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,386 INFO L899 garLoopResultBuilder]: For program point L509-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,386 INFO L899 garLoopResultBuilder]: For program point L476-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,386 INFO L899 garLoopResultBuilder]: For program point L443-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,386 INFO L899 garLoopResultBuilder]: For program point L410-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,386 INFO L899 garLoopResultBuilder]: For program point L278(lines 278 400) no Hoare annotation was computed. [2023-12-16 08:22:01,386 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 400) no Hoare annotation was computed. [2023-12-16 08:22:01,386 INFO L899 garLoopResultBuilder]: For program point L510(line 510) no Hoare annotation was computed. [2023-12-16 08:22:01,386 INFO L899 garLoopResultBuilder]: For program point L213(lines 213 400) no Hoare annotation was computed. [2023-12-16 08:22:01,386 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 400) no Hoare annotation was computed. [2023-12-16 08:22:01,386 INFO L899 garLoopResultBuilder]: For program point L578-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,386 INFO L899 garLoopResultBuilder]: For program point L545-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,386 INFO L899 garLoopResultBuilder]: For program point L512-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,386 INFO L899 garLoopResultBuilder]: For program point L479-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,387 INFO L899 garLoopResultBuilder]: For program point L446-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,387 INFO L899 garLoopResultBuilder]: For program point L413-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,387 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 400) no Hoare annotation was computed. [2023-12-16 08:22:01,387 INFO L899 garLoopResultBuilder]: For program point L248(lines 248 400) no Hoare annotation was computed. [2023-12-16 08:22:01,387 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 400) no Hoare annotation was computed. [2023-12-16 08:22:01,387 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 400) no Hoare annotation was computed. [2023-12-16 08:22:01,387 INFO L899 garLoopResultBuilder]: For program point L382(lines 382 400) no Hoare annotation was computed. [2023-12-16 08:22:01,387 INFO L899 garLoopResultBuilder]: For program point L316(lines 316 400) no Hoare annotation was computed. [2023-12-16 08:22:01,387 INFO L899 garLoopResultBuilder]: For program point L283(lines 283 400) no Hoare annotation was computed. [2023-12-16 08:22:01,387 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 400) no Hoare annotation was computed. [2023-12-16 08:22:01,387 INFO L899 garLoopResultBuilder]: For program point L581-1(lines 581 583) no Hoare annotation was computed. [2023-12-16 08:22:01,387 INFO L899 garLoopResultBuilder]: For program point L548-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,387 INFO L899 garLoopResultBuilder]: For program point L515-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,387 INFO L899 garLoopResultBuilder]: For program point L482-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,387 INFO L899 garLoopResultBuilder]: For program point L449-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,387 INFO L899 garLoopResultBuilder]: For program point L416-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,387 INFO L899 garLoopResultBuilder]: For program point L218(lines 218 400) no Hoare annotation was computed. [2023-12-16 08:22:01,387 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 400) no Hoare annotation was computed. [2023-12-16 08:22:01,387 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 400) no Hoare annotation was computed. [2023-12-16 08:22:01,387 INFO L899 garLoopResultBuilder]: For program point L551-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,387 INFO L899 garLoopResultBuilder]: For program point L518-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,388 INFO L899 garLoopResultBuilder]: For program point L485-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,388 INFO L899 garLoopResultBuilder]: For program point L452-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,388 INFO L899 garLoopResultBuilder]: For program point L419-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,388 INFO L899 garLoopResultBuilder]: For program point L188(lines 188 400) no Hoare annotation was computed. [2023-12-16 08:22:01,388 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 400) no Hoare annotation was computed. [2023-12-16 08:22:01,388 INFO L899 garLoopResultBuilder]: For program point L288(lines 288 400) no Hoare annotation was computed. [2023-12-16 08:22:01,388 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 400) no Hoare annotation was computed. [2023-12-16 08:22:01,388 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 400) no Hoare annotation was computed. [2023-12-16 08:22:01,388 INFO L899 garLoopResultBuilder]: For program point L355(lines 355 400) no Hoare annotation was computed. [2023-12-16 08:22:01,388 INFO L899 garLoopResultBuilder]: For program point L322(lines 322 400) no Hoare annotation was computed. [2023-12-16 08:22:01,388 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 08:22:01,388 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 400) no Hoare annotation was computed. [2023-12-16 08:22:01,388 INFO L899 garLoopResultBuilder]: For program point L587(lines 587 604) no Hoare annotation was computed. [2023-12-16 08:22:01,388 INFO L899 garLoopResultBuilder]: For program point L554-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,388 INFO L899 garLoopResultBuilder]: For program point L521-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,388 INFO L899 garLoopResultBuilder]: For program point L488-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,388 INFO L899 garLoopResultBuilder]: For program point L455-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,388 INFO L899 garLoopResultBuilder]: For program point L422-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,388 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 400) no Hoare annotation was computed. [2023-12-16 08:22:01,388 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 400) no Hoare annotation was computed. [2023-12-16 08:22:01,388 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 400) no Hoare annotation was computed. [2023-12-16 08:22:01,389 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 400) no Hoare annotation was computed. [2023-12-16 08:22:01,389 INFO L899 garLoopResultBuilder]: For program point L557-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,389 INFO L899 garLoopResultBuilder]: For program point L524-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,389 INFO L899 garLoopResultBuilder]: For program point L491-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,389 INFO L899 garLoopResultBuilder]: For program point L458-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,389 INFO L899 garLoopResultBuilder]: For program point L392(lines 392 400) no Hoare annotation was computed. [2023-12-16 08:22:01,389 INFO L899 garLoopResultBuilder]: For program point L425-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,389 INFO L899 garLoopResultBuilder]: For program point L326(lines 326 400) no Hoare annotation was computed. [2023-12-16 08:22:01,389 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 400) no Hoare annotation was computed. [2023-12-16 08:22:01,389 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 08:22:01,389 INFO L899 garLoopResultBuilder]: For program point L228(lines 228 400) no Hoare annotation was computed. [2023-12-16 08:22:01,389 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 400) no Hoare annotation was computed. [2023-12-16 08:22:01,389 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 400) no Hoare annotation was computed. [2023-12-16 08:22:01,389 INFO L899 garLoopResultBuilder]: For program point L328(lines 328 400) no Hoare annotation was computed. [2023-12-16 08:22:01,389 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 400) no Hoare annotation was computed. [2023-12-16 08:22:01,389 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 400) no Hoare annotation was computed. [2023-12-16 08:22:01,389 INFO L899 garLoopResultBuilder]: For program point L560-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,390 INFO L895 garLoopResultBuilder]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse0 (= (_ bv1 32) ~a20~0)) (.cse5 (= (_ bv8 32) ~a12~0))) (let ((.cse4 (= (_ bv5 32) ~a16~0)) (.cse14 (not .cse5)) (.cse7 (not .cse0))) (let ((.cse3 (= (_ bv1 32) ~a17~0)) (.cse11 (or .cse14 .cse7)) (.cse1 (= ~a8~0 (_ bv15 32))) (.cse6 (= ~a7~0 (_ bv1 32))) (.cse12 (not (= (_ bv6 32) ~a16~0))) (.cse13 (not .cse4)) (.cse9 (= (_ bv0 32) ~a17~0)) (.cse10 (= (_ bv14 32) ~a8~0)) (.cse2 (= ~a7~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~a21~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 (or .cse7 (not .cse8))) (and .cse6 .cse9 .cse10 .cse4 .cse8) (and .cse5 .cse1 (not .cse3) .cse2 .cse8) (and .cse2 .cse4 .cse8 .cse11) (and .cse6 .cse4 .cse8 .cse11) (and .cse0 .cse5 .cse2 .cse12 .cse13 .cse8) (and .cse5 .cse1 .cse2 .cse7 .cse8) (and .cse0 .cse6 (or .cse14 (and .cse12 .cse13)) .cse8) (and .cse5 .cse2 .cse7 .cse9 .cse10 .cse8) (and .cse2 (= ~a8~0 (_ bv13 32)) .cse8))))) [2023-12-16 08:22:01,390 INFO L899 garLoopResultBuilder]: For program point L527-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,390 INFO L899 garLoopResultBuilder]: For program point L494-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,390 INFO L899 garLoopResultBuilder]: For program point L461-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,390 INFO L899 garLoopResultBuilder]: For program point L428-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,390 INFO L899 garLoopResultBuilder]: For program point L296(lines 296 400) no Hoare annotation was computed. [2023-12-16 08:22:01,390 INFO L899 garLoopResultBuilder]: For program point calculate_output_returnLabel#1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,390 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 510) no Hoare annotation was computed. [2023-12-16 08:22:01,391 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 400) no Hoare annotation was computed. [2023-12-16 08:22:01,391 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 400) no Hoare annotation was computed. [2023-12-16 08:22:01,391 INFO L899 garLoopResultBuilder]: For program point L563-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,391 INFO L899 garLoopResultBuilder]: For program point L530-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,391 INFO L899 garLoopResultBuilder]: For program point L497-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,391 INFO L899 garLoopResultBuilder]: For program point L464-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,391 INFO L899 garLoopResultBuilder]: For program point L431-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:01,391 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 400) no Hoare annotation was computed. [2023-12-16 08:22:01,391 INFO L899 garLoopResultBuilder]: For program point L266(lines 266 400) no Hoare annotation was computed. [2023-12-16 08:22:01,391 INFO L899 garLoopResultBuilder]: For program point L233(lines 233 400) no Hoare annotation was computed. [2023-12-16 08:22:01,391 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 400) no Hoare annotation was computed. [2023-12-16 08:22:01,394 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:22:01,395 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 08:22:01,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 08:22:01 BoogieIcfgContainer [2023-12-16 08:22:01,404 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 08:22:01,404 INFO L158 Benchmark]: Toolchain (without parser) took 28497.95ms. Allocated memory was 260.0MB in the beginning and 480.2MB in the end (delta: 220.2MB). Free memory was 211.1MB in the beginning and 189.6MB in the end (delta: 21.5MB). Peak memory consumption was 241.7MB. Max. memory is 8.0GB. [2023-12-16 08:22:01,404 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 179.3MB. Free memory is still 135.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 08:22:01,404 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.47ms. Allocated memory is still 260.0MB. Free memory was 211.1MB in the beginning and 181.2MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-12-16 08:22:01,405 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.13ms. Allocated memory is still 260.0MB. Free memory was 181.2MB in the beginning and 175.4MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-16 08:22:01,405 INFO L158 Benchmark]: Boogie Preprocessor took 98.45ms. Allocated memory is still 260.0MB. Free memory was 175.4MB in the beginning and 170.2MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 08:22:01,405 INFO L158 Benchmark]: RCFGBuilder took 1082.04ms. Allocated memory is still 260.0MB. Free memory was 169.6MB in the beginning and 139.6MB in the end (delta: 30.1MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. [2023-12-16 08:22:01,405 INFO L158 Benchmark]: TraceAbstraction took 26857.36ms. Allocated memory was 260.0MB in the beginning and 480.2MB in the end (delta: 220.2MB). Free memory was 139.1MB in the beginning and 189.6MB in the end (delta: -50.5MB). Peak memory consumption was 170.2MB. Max. memory is 8.0GB. [2023-12-16 08:22:01,406 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.13ms. Allocated memory is still 179.3MB. Free memory is still 135.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 395.47ms. Allocated memory is still 260.0MB. Free memory was 211.1MB in the beginning and 181.2MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.13ms. Allocated memory is still 260.0MB. Free memory was 181.2MB in the beginning and 175.4MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 98.45ms. Allocated memory is still 260.0MB. Free memory was 175.4MB in the beginning and 170.2MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1082.04ms. Allocated memory is still 260.0MB. Free memory was 169.6MB in the beginning and 139.6MB in the end (delta: 30.1MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. * TraceAbstraction took 26857.36ms. Allocated memory was 260.0MB in the beginning and 480.2MB in the end (delta: 220.2MB). Free memory was 139.1MB in the beginning and 189.6MB in the end (delta: -50.5MB). Peak memory consumption was 170.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 510]: 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 1 procedures, 136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.8s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4552 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4552 mSDsluCounter, 1038 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 196 mSDsCounter, 925 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9776 IncrementalHoareTripleChecker+Invalid, 10701 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 925 mSolverCounterUnsat, 842 mSDtfsCounter, 9776 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2999 GetRequests, 2933 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1799occurred in iteration=11, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 2432 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 24 NumberOfFragments, 196 HoareAnnotationTreeSize, 1 FormulaSimplifications, 1687 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FormulaSimplificationsInter, 615 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 2341 NumberOfCodeBlocks, 2341 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2979 ConstructedInterpolants, 0 QuantifiedInterpolants, 22944 SizeOfPredicates, 42 NumberOfNonLiveVariables, 3274 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 1829/2036 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: 593]: Loop Invariant Derived loop invariant: (((((((((((((((1 == a20) && (a8 == 15)) && (a7 == 0)) && (1 == a17)) && (5 == a16)) || (((8 == a12) && (a7 == 1)) && (!((1 == a20)) || !((1 == a21))))) || (((((a7 == 1) && (0 == a17)) && (14 == a8)) && (5 == a16)) && (1 == a21))) || (((((8 == a12) && (a8 == 15)) && !((1 == a17))) && (a7 == 0)) && (1 == a21))) || ((((a7 == 0) && (5 == a16)) && (1 == a21)) && (!((8 == a12)) || !((1 == a20))))) || ((((a7 == 1) && (5 == a16)) && (1 == a21)) && (!((8 == a12)) || !((1 == a20))))) || ((((((1 == a20) && (8 == a12)) && (a7 == 0)) && !((6 == a16))) && !((5 == a16))) && (1 == a21))) || (((((8 == a12) && (a8 == 15)) && (a7 == 0)) && !((1 == a20))) && (1 == a21))) || ((((1 == a20) && (a7 == 1)) && (!((8 == a12)) || (!((6 == a16)) && !((5 == a16))))) && (1 == a21))) || ((((((8 == a12) && (a7 == 0)) && !((1 == a20))) && (0 == a17)) && (14 == a8)) && (1 == a21))) || (((a7 == 0) && (a8 == 13)) && (1 == a21))) RESULT: Ultimate proved your program to be correct! [2023-12-16 08:22:01,432 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...