/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/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 07:35:37,327 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 07:35:37,404 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 07:35:37,410 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 07:35:37,411 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 07:35:37,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 07:35:37,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 07:35:37,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 07:35:37,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 07:35:37,441 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 07:35:37,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 07:35:37,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 07:35:37,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 07:35:37,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 07:35:37,442 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 07:35:37,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 07:35:37,443 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 07:35:37,443 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 07:35:37,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 07:35:37,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 07:35:37,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 07:35:37,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 07:35:37,444 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 07:35:37,444 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 07:35:37,445 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 07:35:37,445 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 07:35:37,445 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 07:35:37,445 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 07:35:37,446 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 07:35:37,446 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 07:35:37,446 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 07:35:37,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 07:35:37,447 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 07:35:37,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 07:35:37,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:35:37,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 07:35:37,447 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 07:35:37,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 07:35:37,448 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 07:35:37,448 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 07:35:37,448 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 07:35:37,453 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 07:35:37,453 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 07:35:37,453 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 07:35:37,453 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 07:35:37,453 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 07:35:37,453 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 07:35:37,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 07:35:37,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 07:35:37,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 07:35:37,822 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 07:35:37,823 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 07:35:37,824 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2023-12-25 07:35:38,952 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 07:35:39,165 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 07:35:39,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2023-12-25 07:35:39,195 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fd5a778d/e50a7792f5044bb5964034b7b7bf88db/FLAG7946f03cf [2023-12-25 07:35:39,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fd5a778d/e50a7792f5044bb5964034b7b7bf88db [2023-12-25 07:35:39,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 07:35:39,210 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 07:35:39,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 07:35:39,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 07:35:39,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 07:35:39,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:35:39" (1/1) ... [2023-12-25 07:35:39,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e0120be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:39, skipping insertion in model container [2023-12-25 07:35:39,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:35:39" (1/1) ... [2023-12-25 07:35:39,253 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 07:35:39,424 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2023-12-25 07:35:39,426 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:35:39,433 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 07:35:39,482 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2023-12-25 07:35:39,483 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:35:39,500 INFO L206 MainTranslator]: Completed translation [2023-12-25 07:35:39,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:39 WrapperNode [2023-12-25 07:35:39,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 07:35:39,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 07:35:39,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 07:35:39,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 07:35:39,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:39" (1/1) ... [2023-12-25 07:35:39,530 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:39" (1/1) ... [2023-12-25 07:35:39,570 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 229 [2023-12-25 07:35:39,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 07:35:39,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 07:35:39,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 07:35:39,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 07:35:39,577 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:39" (1/1) ... [2023-12-25 07:35:39,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:39" (1/1) ... [2023-12-25 07:35:39,579 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:39" (1/1) ... [2023-12-25 07:35:39,587 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 07:35:39,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:39" (1/1) ... [2023-12-25 07:35:39,587 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:39" (1/1) ... [2023-12-25 07:35:39,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:39" (1/1) ... [2023-12-25 07:35:39,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:39" (1/1) ... [2023-12-25 07:35:39,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:39" (1/1) ... [2023-12-25 07:35:39,611 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:39" (1/1) ... [2023-12-25 07:35:39,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 07:35:39,614 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 07:35:39,614 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 07:35:39,614 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 07:35:39,614 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:39" (1/1) ... [2023-12-25 07:35:39,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:35:39,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 07:35:39,642 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 07:35:39,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 07:35:39,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 07:35:39,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 07:35:39,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 07:35:39,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 07:35:39,718 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 07:35:39,719 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 07:35:39,934 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 07:35:39,956 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 07:35:39,956 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 07:35:39,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:35:39 BoogieIcfgContainer [2023-12-25 07:35:39,957 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 07:35:39,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 07:35:39,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 07:35:39,960 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 07:35:39,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 07:35:39" (1/3) ... [2023-12-25 07:35:39,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df90189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:35:39, skipping insertion in model container [2023-12-25 07:35:39,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:35:39" (2/3) ... [2023-12-25 07:35:39,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df90189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:35:39, skipping insertion in model container [2023-12-25 07:35:39,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:35:39" (3/3) ... [2023-12-25 07:35:39,962 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2023-12-25 07:35:39,974 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 07:35:39,974 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 07:35:40,011 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 07:35:40,016 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;@4101d090, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 07:35:40,016 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 07:35:40,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 60 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:40,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-25 07:35:40,026 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:40,027 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] [2023-12-25 07:35:40,027 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:40,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:40,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1331125770, now seen corresponding path program 1 times [2023-12-25 07:35:40,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:40,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408813365] [2023-12-25 07:35:40,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:40,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-25 07:35:40,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:40,045 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:35:40,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 07:35:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:40,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:35:40,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:40,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:40,215 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:40,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:40,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408813365] [2023-12-25 07:35:40,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408813365] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:40,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:40,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:35:40,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372147706] [2023-12-25 07:35:40,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:40,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:35:40,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:40,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:35:40,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:35:40,250 INFO L87 Difference]: Start difference. First operand has 61 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 60 states have internal predecessors, (104), 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 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:40,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:40,328 INFO L93 Difference]: Finished difference Result 142 states and 237 transitions. [2023-12-25 07:35:40,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:35:40,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2023-12-25 07:35:40,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:40,336 INFO L225 Difference]: With dead ends: 142 [2023-12-25 07:35:40,336 INFO L226 Difference]: Without dead ends: 97 [2023-12-25 07:35:40,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:35:40,340 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 60 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:40,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 264 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:40,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-25 07:35:40,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 59. [2023-12-25 07:35:40,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 58 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:40,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2023-12-25 07:35:40,366 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 22 [2023-12-25 07:35:40,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:40,366 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2023-12-25 07:35:40,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:40,367 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2023-12-25 07:35:40,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 07:35:40,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:40,368 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] [2023-12-25 07:35:40,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 07:35:40,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:40,571 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:40,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:40,572 INFO L85 PathProgramCache]: Analyzing trace with hash 855144128, now seen corresponding path program 1 times [2023-12-25 07:35:40,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:40,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456286923] [2023-12-25 07:35:40,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:40,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:40,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:40,574 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:35:40,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 07:35:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:40,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:40,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:40,744 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:40,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:40,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456286923] [2023-12-25 07:35:40,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456286923] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:40,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:40,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:40,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991863465] [2023-12-25 07:35:40,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:40,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:40,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:40,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:40,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:40,748 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:40,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:40,784 INFO L93 Difference]: Finished difference Result 127 states and 190 transitions. [2023-12-25 07:35:40,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:40,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 38 [2023-12-25 07:35:40,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:40,786 INFO L225 Difference]: With dead ends: 127 [2023-12-25 07:35:40,786 INFO L226 Difference]: Without dead ends: 89 [2023-12-25 07:35:40,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:40,788 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 45 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:40,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 167 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:40,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-25 07:35:40,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2023-12-25 07:35:40,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.4767441860465116) internal successors, (127), 86 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 127 transitions. [2023-12-25 07:35:40,796 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 127 transitions. Word has length 38 [2023-12-25 07:35:40,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:40,797 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 127 transitions. [2023-12-25 07:35:40,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:40,797 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 127 transitions. [2023-12-25 07:35:40,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 07:35:40,798 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:40,798 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] [2023-12-25 07:35:40,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 07:35:40,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:40,998 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:40,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:40,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1766348127, now seen corresponding path program 1 times [2023-12-25 07:35:40,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:41,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281216311] [2023-12-25 07:35:41,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:41,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:41,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:41,005 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:35:41,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 07:35:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:41,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:41,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:41,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:41,087 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:41,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:41,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281216311] [2023-12-25 07:35:41,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281216311] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:41,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:41,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:41,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362652971] [2023-12-25 07:35:41,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:41,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:41,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:41,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:41,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:41,089 INFO L87 Difference]: Start difference. First operand 87 states and 127 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:41,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:41,105 INFO L93 Difference]: Finished difference Result 203 states and 311 transitions. [2023-12-25 07:35:41,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:41,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 38 [2023-12-25 07:35:41,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:41,106 INFO L225 Difference]: With dead ends: 203 [2023-12-25 07:35:41,106 INFO L226 Difference]: Without dead ends: 137 [2023-12-25 07:35:41,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:41,108 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 41 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:41,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 164 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:41,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-12-25 07:35:41,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2023-12-25 07:35:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.507462686567164) internal successors, (202), 134 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 202 transitions. [2023-12-25 07:35:41,117 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 202 transitions. Word has length 38 [2023-12-25 07:35:41,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:41,117 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 202 transitions. [2023-12-25 07:35:41,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 202 transitions. [2023-12-25 07:35:41,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 07:35:41,118 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:41,118 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] [2023-12-25 07:35:41,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 07:35:41,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:41,321 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:41,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:41,322 INFO L85 PathProgramCache]: Analyzing trace with hash -2141824130, now seen corresponding path program 1 times [2023-12-25 07:35:41,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:41,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090227337] [2023-12-25 07:35:41,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:41,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:41,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:41,331 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:35:41,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 07:35:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:41,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:35:41,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:41,624 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:41,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:41,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090227337] [2023-12-25 07:35:41,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090227337] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:41,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:41,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:35:41,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284191389] [2023-12-25 07:35:41,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:41,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:35:41,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:41,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:35:41,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:35:41,630 INFO L87 Difference]: Start difference. First operand 135 states and 202 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:41,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:41,725 INFO L93 Difference]: Finished difference Result 591 states and 926 transitions. [2023-12-25 07:35:41,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:35:41,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 38 [2023-12-25 07:35:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:41,729 INFO L225 Difference]: With dead ends: 591 [2023-12-25 07:35:41,729 INFO L226 Difference]: Without dead ends: 477 [2023-12-25 07:35:41,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:35:41,730 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 165 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:41,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 409 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:35:41,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2023-12-25 07:35:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 247. [2023-12-25 07:35:41,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.5203252032520325) internal successors, (374), 246 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:41,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 374 transitions. [2023-12-25 07:35:41,746 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 374 transitions. Word has length 38 [2023-12-25 07:35:41,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:41,746 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 374 transitions. [2023-12-25 07:35:41,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:41,747 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 374 transitions. [2023-12-25 07:35:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-25 07:35:41,747 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:41,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:35:41,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-25 07:35:41,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:41,950 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:41,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:41,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1985069537, now seen corresponding path program 1 times [2023-12-25 07:35:41,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:41,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351820041] [2023-12-25 07:35:41,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:41,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:41,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:41,961 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:35:41,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 07:35:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:42,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 07:35:42,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:42,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:42,051 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:42,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:42,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351820041] [2023-12-25 07:35:42,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [351820041] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:42,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:42,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:35:42,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058072552] [2023-12-25 07:35:42,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:42,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:35:42,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:42,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:35:42,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:35:42,053 INFO L87 Difference]: Start difference. First operand 247 states and 374 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:42,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:42,073 INFO L93 Difference]: Finished difference Result 273 states and 407 transitions. [2023-12-25 07:35:42,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:35:42,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 39 [2023-12-25 07:35:42,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:42,075 INFO L225 Difference]: With dead ends: 273 [2023-12-25 07:35:42,075 INFO L226 Difference]: Without dead ends: 271 [2023-12-25 07:35:42,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:35:42,076 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:42,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 227 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:42,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-12-25 07:35:42,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 263. [2023-12-25 07:35:42,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 1.4885496183206106) internal successors, (390), 262 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:42,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 390 transitions. [2023-12-25 07:35:42,103 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 390 transitions. Word has length 39 [2023-12-25 07:35:42,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:42,103 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 390 transitions. [2023-12-25 07:35:42,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:42,103 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 390 transitions. [2023-12-25 07:35:42,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-25 07:35:42,104 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:42,104 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] [2023-12-25 07:35:42,109 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-25 07:35:42,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:42,307 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:42,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:42,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1406583098, now seen corresponding path program 1 times [2023-12-25 07:35:42,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:42,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034782467] [2023-12-25 07:35:42,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:42,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:42,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:42,309 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:35:42,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 07:35:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:42,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:42,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:42,419 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:42,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:42,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034782467] [2023-12-25 07:35:42,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034782467] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:42,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:42,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:42,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596897057] [2023-12-25 07:35:42,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:42,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:42,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:42,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:42,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:42,421 INFO L87 Difference]: Start difference. First operand 263 states and 390 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:42,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:42,438 INFO L93 Difference]: Finished difference Result 691 states and 1032 transitions. [2023-12-25 07:35:42,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:42,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 40 [2023-12-25 07:35:42,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:42,440 INFO L225 Difference]: With dead ends: 691 [2023-12-25 07:35:42,440 INFO L226 Difference]: Without dead ends: 449 [2023-12-25 07:35:42,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:42,442 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 34 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:42,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 137 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:42,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2023-12-25 07:35:42,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2023-12-25 07:35:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.4663677130044843) internal successors, (654), 446 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:42,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 654 transitions. [2023-12-25 07:35:42,454 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 654 transitions. Word has length 40 [2023-12-25 07:35:42,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:42,455 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 654 transitions. [2023-12-25 07:35:42,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:42,455 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 654 transitions. [2023-12-25 07:35:42,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-25 07:35:42,456 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:42,456 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] [2023-12-25 07:35:42,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 07:35:42,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:42,665 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:42,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:42,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1835898686, now seen corresponding path program 1 times [2023-12-25 07:35:42,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:42,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493418115] [2023-12-25 07:35:42,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:42,666 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:42,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:42,667 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:35:42,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 07:35:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:42,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:42,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:42,769 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:42,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:42,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493418115] [2023-12-25 07:35:42,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493418115] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:42,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:42,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:42,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190309557] [2023-12-25 07:35:42,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:42,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:42,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:42,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:42,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:42,771 INFO L87 Difference]: Start difference. First operand 447 states and 654 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:42,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:42,807 INFO L93 Difference]: Finished difference Result 877 states and 1299 transitions. [2023-12-25 07:35:42,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:42,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 40 [2023-12-25 07:35:42,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:42,818 INFO L225 Difference]: With dead ends: 877 [2023-12-25 07:35:42,818 INFO L226 Difference]: Without dead ends: 635 [2023-12-25 07:35:42,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:42,820 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 49 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:42,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 177 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:42,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2023-12-25 07:35:42,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2023-12-25 07:35:42,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.4556962025316456) internal successors, (920), 632 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 920 transitions. [2023-12-25 07:35:42,836 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 920 transitions. Word has length 40 [2023-12-25 07:35:42,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:42,836 INFO L495 AbstractCegarLoop]: Abstraction has 633 states and 920 transitions. [2023-12-25 07:35:42,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:42,836 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 920 transitions. [2023-12-25 07:35:42,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-25 07:35:42,841 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:42,841 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:35:42,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 07:35:43,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:43,048 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:43,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:43,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1126850639, now seen corresponding path program 1 times [2023-12-25 07:35:43,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:43,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27273308] [2023-12-25 07:35:43,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:43,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:43,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:43,064 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:35:43,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 07:35:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:43,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 07:35:43,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:43,824 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:43,824 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:35:44,112 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:44,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:44,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27273308] [2023-12-25 07:35:44,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27273308] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:35:44,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:35:44,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 07:35:44,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971055852] [2023-12-25 07:35:44,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:35:44,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:35:44,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:44,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:35:44,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:35:44,122 INFO L87 Difference]: Start difference. First operand 633 states and 920 transitions. Second operand has 16 states, 16 states have (on average 6.25) internal successors, (100), 15 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:44,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:44,745 INFO L93 Difference]: Finished difference Result 2103 states and 3027 transitions. [2023-12-25 07:35:44,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 07:35:44,745 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.25) internal successors, (100), 15 states have internal predecessors, (100), 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 58 [2023-12-25 07:35:44,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:44,751 INFO L225 Difference]: With dead ends: 2103 [2023-12-25 07:35:44,751 INFO L226 Difference]: Without dead ends: 1677 [2023-12-25 07:35:44,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=516, Unknown=0, NotChecked=0, Total=702 [2023-12-25 07:35:44,756 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 492 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:44,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 474 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 07:35:44,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2023-12-25 07:35:44,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1333. [2023-12-25 07:35:44,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 1332 states have (on average 1.4504504504504505) internal successors, (1932), 1332 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:44,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1932 transitions. [2023-12-25 07:35:44,804 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1932 transitions. Word has length 58 [2023-12-25 07:35:44,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:44,804 INFO L495 AbstractCegarLoop]: Abstraction has 1333 states and 1932 transitions. [2023-12-25 07:35:44,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.25) internal successors, (100), 15 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1932 transitions. [2023-12-25 07:35:44,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 07:35:44,805 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:44,805 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:35:44,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-25 07:35:45,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:45,025 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:45,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:45,025 INFO L85 PathProgramCache]: Analyzing trace with hash -454931966, now seen corresponding path program 1 times [2023-12-25 07:35:45,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:45,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017773840] [2023-12-25 07:35:45,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:45,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:45,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:45,027 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:35:45,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 07:35:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:45,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 07:35:45,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:45,493 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:45,493 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:35:45,643 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:45,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:45,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017773840] [2023-12-25 07:35:45,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017773840] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:35:45,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:35:45,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 07:35:45,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097697652] [2023-12-25 07:35:45,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:35:45,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:35:45,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:45,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:35:45,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:35:45,645 INFO L87 Difference]: Start difference. First operand 1333 states and 1932 transitions. Second operand has 16 states, 16 states have (on average 6.625) internal successors, (106), 15 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:46,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:46,356 INFO L93 Difference]: Finished difference Result 5895 states and 8579 transitions. [2023-12-25 07:35:46,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 07:35:46,357 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 15 states have internal predecessors, (106), 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 59 [2023-12-25 07:35:46,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:46,370 INFO L225 Difference]: With dead ends: 5895 [2023-12-25 07:35:46,370 INFO L226 Difference]: Without dead ends: 4585 [2023-12-25 07:35:46,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2023-12-25 07:35:46,373 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 1439 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1439 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:46,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1439 Valid, 488 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 07:35:46,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4585 states. [2023-12-25 07:35:46,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4585 to 2903. [2023-12-25 07:35:46,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2903 states, 2902 states have (on average 1.445210199862164) internal successors, (4194), 2902 states have internal predecessors, (4194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:46,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2903 states to 2903 states and 4194 transitions. [2023-12-25 07:35:46,471 INFO L78 Accepts]: Start accepts. Automaton has 2903 states and 4194 transitions. Word has length 59 [2023-12-25 07:35:46,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:46,472 INFO L495 AbstractCegarLoop]: Abstraction has 2903 states and 4194 transitions. [2023-12-25 07:35:46,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 15 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:46,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2903 states and 4194 transitions. [2023-12-25 07:35:46,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 07:35:46,473 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:46,473 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:35:46,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 07:35:46,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:46,676 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:46,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:46,680 INFO L85 PathProgramCache]: Analyzing trace with hash -961217311, now seen corresponding path program 1 times [2023-12-25 07:35:46,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:46,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189147992] [2023-12-25 07:35:46,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:46,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:46,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:46,681 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:35:46,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 07:35:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:46,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:46,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:46,813 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:46,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:46,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189147992] [2023-12-25 07:35:46,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189147992] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:46,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:46,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:46,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841315083] [2023-12-25 07:35:46,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:46,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:46,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:46,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:46,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:46,815 INFO L87 Difference]: Start difference. First operand 2903 states and 4194 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:46,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:46,902 INFO L93 Difference]: Finished difference Result 5785 states and 8366 transitions. [2023-12-25 07:35:46,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:46,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2023-12-25 07:35:46,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:46,910 INFO L225 Difference]: With dead ends: 5785 [2023-12-25 07:35:46,911 INFO L226 Difference]: Without dead ends: 2905 [2023-12-25 07:35:46,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:46,917 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 38 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:46,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 166 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:46,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2023-12-25 07:35:46,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 2807. [2023-12-25 07:35:46,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2807 states, 2806 states have (on average 1.4233784746970777) internal successors, (3994), 2806 states have internal predecessors, (3994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:47,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2807 states and 3994 transitions. [2023-12-25 07:35:47,007 INFO L78 Accepts]: Start accepts. Automaton has 2807 states and 3994 transitions. Word has length 59 [2023-12-25 07:35:47,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:47,007 INFO L495 AbstractCegarLoop]: Abstraction has 2807 states and 3994 transitions. [2023-12-25 07:35:47,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2807 states and 3994 transitions. [2023-12-25 07:35:47,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 07:35:47,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:47,011 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:35:47,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 07:35:47,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:47,214 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:47,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:47,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1200740092, now seen corresponding path program 1 times [2023-12-25 07:35:47,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:47,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141229674] [2023-12-25 07:35:47,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:47,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:47,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:47,225 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:35:47,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 07:35:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:47,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:47,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:47,284 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:47,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:47,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141229674] [2023-12-25 07:35:47,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1141229674] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:47,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:47,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:47,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161083188] [2023-12-25 07:35:47,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:47,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:47,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:47,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:47,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:47,285 INFO L87 Difference]: Start difference. First operand 2807 states and 3994 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:47,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:47,327 INFO L93 Difference]: Finished difference Result 4074 states and 5804 transitions. [2023-12-25 07:35:47,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:47,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2023-12-25 07:35:47,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:47,331 INFO L225 Difference]: With dead ends: 4074 [2023-12-25 07:35:47,331 INFO L226 Difference]: Without dead ends: 1290 [2023-12-25 07:35:47,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:47,333 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 31 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:47,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 155 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:47,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2023-12-25 07:35:47,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1268. [2023-12-25 07:35:47,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 1267 states have (on average 1.4033149171270718) internal successors, (1778), 1267 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:47,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1778 transitions. [2023-12-25 07:35:47,366 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1778 transitions. Word has length 59 [2023-12-25 07:35:47,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:47,366 INFO L495 AbstractCegarLoop]: Abstraction has 1268 states and 1778 transitions. [2023-12-25 07:35:47,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:47,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1778 transitions. [2023-12-25 07:35:47,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 07:35:47,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:47,367 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:35:47,379 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-25 07:35:47,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:47,579 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:47,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:47,580 INFO L85 PathProgramCache]: Analyzing trace with hash -849298752, now seen corresponding path program 1 times [2023-12-25 07:35:47,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:47,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374033774] [2023-12-25 07:35:47,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:47,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:47,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:47,602 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:35:47,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 07:35:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:47,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 07:35:47,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:48,052 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:48,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:35:48,258 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:48,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:48,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374033774] [2023-12-25 07:35:48,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374033774] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:35:48,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:35:48,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 07:35:48,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920593089] [2023-12-25 07:35:48,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:35:48,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:35:48,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:48,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:35:48,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:35:48,260 INFO L87 Difference]: Start difference. First operand 1268 states and 1778 transitions. Second operand has 16 states, 16 states have (on average 6.875) internal successors, (110), 15 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:48,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:48,862 INFO L93 Difference]: Finished difference Result 5226 states and 7327 transitions. [2023-12-25 07:35:48,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 07:35:48,862 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.875) internal successors, (110), 15 states have internal predecessors, (110), 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 59 [2023-12-25 07:35:48,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:48,872 INFO L225 Difference]: With dead ends: 5226 [2023-12-25 07:35:48,872 INFO L226 Difference]: Without dead ends: 4018 [2023-12-25 07:35:48,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2023-12-25 07:35:48,875 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 648 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:48,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 349 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:35:48,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4018 states. [2023-12-25 07:35:48,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4018 to 3018. [2023-12-25 07:35:49,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3018 states, 3017 states have (on average 1.3987404706662248) internal successors, (4220), 3017 states have internal predecessors, (4220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:49,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 4220 transitions. [2023-12-25 07:35:49,006 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 4220 transitions. Word has length 59 [2023-12-25 07:35:49,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:49,006 INFO L495 AbstractCegarLoop]: Abstraction has 3018 states and 4220 transitions. [2023-12-25 07:35:49,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.875) internal successors, (110), 15 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:49,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 4220 transitions. [2023-12-25 07:35:49,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 07:35:49,007 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:49,007 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:35:49,012 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-25 07:35:49,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:49,210 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:49,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:49,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1493546271, now seen corresponding path program 1 times [2023-12-25 07:35:49,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:49,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050636016] [2023-12-25 07:35:49,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:49,211 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:49,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:49,212 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:35:49,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-25 07:35:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:49,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:49,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:49,271 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:49,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:49,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050636016] [2023-12-25 07:35:49,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050636016] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:49,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:49,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:49,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731818751] [2023-12-25 07:35:49,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:49,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:49,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:49,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:49,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:49,273 INFO L87 Difference]: Start difference. First operand 3018 states and 4220 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:49,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:49,319 INFO L93 Difference]: Finished difference Result 4780 states and 6662 transitions. [2023-12-25 07:35:49,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:49,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2023-12-25 07:35:49,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:49,324 INFO L225 Difference]: With dead ends: 4780 [2023-12-25 07:35:49,324 INFO L226 Difference]: Without dead ends: 1848 [2023-12-25 07:35:49,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:49,327 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 29 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:49,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 133 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:49,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2023-12-25 07:35:49,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1846. [2023-12-25 07:35:49,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1846 states, 1845 states have (on average 1.359349593495935) internal successors, (2508), 1845 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:49,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 2508 transitions. [2023-12-25 07:35:49,372 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 2508 transitions. Word has length 59 [2023-12-25 07:35:49,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:49,372 INFO L495 AbstractCegarLoop]: Abstraction has 1846 states and 2508 transitions. [2023-12-25 07:35:49,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:49,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2508 transitions. [2023-12-25 07:35:49,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-25 07:35:49,375 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:49,376 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:35:49,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-25 07:35:49,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:49,578 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:49,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:49,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1248541119, now seen corresponding path program 1 times [2023-12-25 07:35:49,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:49,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728931012] [2023-12-25 07:35:49,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:49,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:49,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:49,580 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:35:49,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-25 07:35:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:49,676 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:35:49,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 07:35:49,743 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:35:49,820 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 07:35:49,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:49,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728931012] [2023-12-25 07:35:49,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728931012] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:35:49,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:35:49,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-25 07:35:49,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630874625] [2023-12-25 07:35:49,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:35:49,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 07:35:49,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:49,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 07:35:49,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:35:49,822 INFO L87 Difference]: Start difference. First operand 1846 states and 2508 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:50,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:50,001 INFO L93 Difference]: Finished difference Result 6340 states and 8558 transitions. [2023-12-25 07:35:50,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:35:50,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 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 60 [2023-12-25 07:35:50,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:50,014 INFO L225 Difference]: With dead ends: 6340 [2023-12-25 07:35:50,014 INFO L226 Difference]: Without dead ends: 4580 [2023-12-25 07:35:50,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:35:50,017 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 100 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:50,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 344 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:50,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4580 states. [2023-12-25 07:35:50,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4580 to 4306. [2023-12-25 07:35:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4306 states, 4305 states have (on average 1.326829268292683) internal successors, (5712), 4305 states have internal predecessors, (5712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4306 states to 4306 states and 5712 transitions. [2023-12-25 07:35:50,146 INFO L78 Accepts]: Start accepts. Automaton has 4306 states and 5712 transitions. Word has length 60 [2023-12-25 07:35:50,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:50,146 INFO L495 AbstractCegarLoop]: Abstraction has 4306 states and 5712 transitions. [2023-12-25 07:35:50,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand 4306 states and 5712 transitions. [2023-12-25 07:35:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-25 07:35:50,147 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:50,147 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:35:50,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-25 07:35:50,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:50,350 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:50,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:50,351 INFO L85 PathProgramCache]: Analyzing trace with hash -978729939, now seen corresponding path program 1 times [2023-12-25 07:35:50,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:50,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905567542] [2023-12-25 07:35:50,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:50,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:50,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:50,353 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:35:50,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-25 07:35:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:50,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:50,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:50,421 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:50,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:50,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [905567542] [2023-12-25 07:35:50,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [905567542] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:50,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:50,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:50,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311462054] [2023-12-25 07:35:50,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:50,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:50,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:50,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:50,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:50,423 INFO L87 Difference]: Start difference. First operand 4306 states and 5712 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:50,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:50,580 INFO L93 Difference]: Finished difference Result 9939 states and 13133 transitions. [2023-12-25 07:35:50,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:50,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2023-12-25 07:35:50,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:50,607 INFO L225 Difference]: With dead ends: 9939 [2023-12-25 07:35:50,607 INFO L226 Difference]: Without dead ends: 6124 [2023-12-25 07:35:50,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:50,614 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 35 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:50,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 180 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:50,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6124 states. [2023-12-25 07:35:50,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6124 to 5750. [2023-12-25 07:35:50,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5750 states, 5749 states have (on average 1.29118107496956) internal successors, (7423), 5749 states have internal predecessors, (7423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5750 states to 5750 states and 7423 transitions. [2023-12-25 07:35:50,833 INFO L78 Accepts]: Start accepts. Automaton has 5750 states and 7423 transitions. Word has length 60 [2023-12-25 07:35:50,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:50,833 INFO L495 AbstractCegarLoop]: Abstraction has 5750 states and 7423 transitions. [2023-12-25 07:35:50,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:50,834 INFO L276 IsEmpty]: Start isEmpty. Operand 5750 states and 7423 transitions. [2023-12-25 07:35:50,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-25 07:35:50,835 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:50,835 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:35:50,847 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 (16)] Ended with exit code 0 [2023-12-25 07:35:51,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:51,038 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:51,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:51,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1742324704, now seen corresponding path program 1 times [2023-12-25 07:35:51,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:51,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158721321] [2023-12-25 07:35:51,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:51,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:51,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:51,040 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:35:51,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-25 07:35:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:51,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 07:35:51,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:51,517 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:35:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:51,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:51,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158721321] [2023-12-25 07:35:51,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1158721321] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:35:51,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:35:51,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-25 07:35:51,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979746940] [2023-12-25 07:35:51,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:35:51,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:35:51,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:51,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:35:51,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:35:51,784 INFO L87 Difference]: Start difference. First operand 5750 states and 7423 transitions. Second operand has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:53,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:53,179 INFO L93 Difference]: Finished difference Result 19940 states and 25652 transitions. [2023-12-25 07:35:53,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-25 07:35:53,180 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 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 60 [2023-12-25 07:35:53,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:53,200 INFO L225 Difference]: With dead ends: 19940 [2023-12-25 07:35:53,200 INFO L226 Difference]: Without dead ends: 14603 [2023-12-25 07:35:53,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=255, Invalid=867, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:35:53,208 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 887 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:53,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 771 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 07:35:53,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14603 states. [2023-12-25 07:35:53,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14603 to 9309. [2023-12-25 07:35:53,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9309 states, 9308 states have (on average 1.2874946282767512) internal successors, (11984), 9308 states have internal predecessors, (11984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:53,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9309 states to 9309 states and 11984 transitions. [2023-12-25 07:35:53,607 INFO L78 Accepts]: Start accepts. Automaton has 9309 states and 11984 transitions. Word has length 60 [2023-12-25 07:35:53,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:53,607 INFO L495 AbstractCegarLoop]: Abstraction has 9309 states and 11984 transitions. [2023-12-25 07:35:53,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:53,607 INFO L276 IsEmpty]: Start isEmpty. Operand 9309 states and 11984 transitions. [2023-12-25 07:35:53,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-25 07:35:53,609 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:53,609 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:35:53,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-25 07:35:53,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:53,811 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:53,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:53,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1534022124, now seen corresponding path program 1 times [2023-12-25 07:35:53,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:53,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956009425] [2023-12-25 07:35:53,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:53,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:53,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:53,825 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:35:53,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-25 07:35:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:53,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:35:53,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:53,911 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:53,911 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:35:53,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:53,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956009425] [2023-12-25 07:35:53,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1956009425] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:35:53,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:35:53,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:35:53,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736600599] [2023-12-25 07:35:53,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:35:53,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:35:53,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:53,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:35:53,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:53,913 INFO L87 Difference]: Start difference. First operand 9309 states and 11984 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:54,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:54,137 INFO L93 Difference]: Finished difference Result 18386 states and 23584 transitions. [2023-12-25 07:35:54,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:35:54,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2023-12-25 07:35:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:54,156 INFO L225 Difference]: With dead ends: 18386 [2023-12-25 07:35:54,156 INFO L226 Difference]: Without dead ends: 9607 [2023-12-25 07:35:54,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:35:54,166 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 35 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:54,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 189 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:35:54,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9607 states. [2023-12-25 07:35:54,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9607 to 7222. [2023-12-25 07:35:54,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7222 states, 7221 states have (on average 1.2629829663481513) internal successors, (9120), 7221 states have internal predecessors, (9120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:54,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7222 states to 7222 states and 9120 transitions. [2023-12-25 07:35:54,402 INFO L78 Accepts]: Start accepts. Automaton has 7222 states and 9120 transitions. Word has length 60 [2023-12-25 07:35:54,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:54,402 INFO L495 AbstractCegarLoop]: Abstraction has 7222 states and 9120 transitions. [2023-12-25 07:35:54,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:54,403 INFO L276 IsEmpty]: Start isEmpty. Operand 7222 states and 9120 transitions. [2023-12-25 07:35:54,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 07:35:54,404 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:54,404 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:35:54,408 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 (18)] Ended with exit code 0 [2023-12-25 07:35:54,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:54,608 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:54,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:54,608 INFO L85 PathProgramCache]: Analyzing trace with hash -760251358, now seen corresponding path program 1 times [2023-12-25 07:35:54,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:54,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306837446] [2023-12-25 07:35:54,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:54,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:54,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:54,610 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:35:54,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-25 07:35:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:54,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 07:35:54,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:55,053 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:55,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:35:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:55,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:55,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306837446] [2023-12-25 07:35:55,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306837446] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:35:55,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:35:55,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-25 07:35:55,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522104449] [2023-12-25 07:35:55,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:35:55,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:35:55,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:55,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:35:55,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:35:55,221 INFO L87 Difference]: Start difference. First operand 7222 states and 9120 transitions. Second operand has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:56,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:56,615 INFO L93 Difference]: Finished difference Result 21122 states and 26728 transitions. [2023-12-25 07:35:56,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-25 07:35:56,616 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 states have internal predecessors, (111), 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 61 [2023-12-25 07:35:56,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:56,656 INFO L225 Difference]: With dead ends: 21122 [2023-12-25 07:35:56,656 INFO L226 Difference]: Without dead ends: 18204 [2023-12-25 07:35:56,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:35:56,666 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 792 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:56,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 770 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 07:35:56,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18204 states. [2023-12-25 07:35:57,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18204 to 13579. [2023-12-25 07:35:57,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13579 states, 13578 states have (on average 1.2617469435852113) internal successors, (17132), 13578 states have internal predecessors, (17132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:57,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13579 states to 13579 states and 17132 transitions. [2023-12-25 07:35:57,141 INFO L78 Accepts]: Start accepts. Automaton has 13579 states and 17132 transitions. Word has length 61 [2023-12-25 07:35:57,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:35:57,141 INFO L495 AbstractCegarLoop]: Abstraction has 13579 states and 17132 transitions. [2023-12-25 07:35:57,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:57,142 INFO L276 IsEmpty]: Start isEmpty. Operand 13579 states and 17132 transitions. [2023-12-25 07:35:57,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 07:35:57,146 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:35:57,147 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:35:57,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-25 07:35:57,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:57,349 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:35:57,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:35:57,350 INFO L85 PathProgramCache]: Analyzing trace with hash 794016731, now seen corresponding path program 1 times [2023-12-25 07:35:57,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:35:57,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759098410] [2023-12-25 07:35:57,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:35:57,350 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:35:57,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:35:57,351 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:35:57,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-25 07:35:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:35:57,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 07:35:57,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:35:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:57,745 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:35:57,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:35:57,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:35:57,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759098410] [2023-12-25 07:35:57,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759098410] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:35:57,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:35:57,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-25 07:35:57,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747724668] [2023-12-25 07:35:57,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:35:57,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:35:57,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:35:57,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:35:57,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:35:57,948 INFO L87 Difference]: Start difference. First operand 13579 states and 17132 transitions. Second operand has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:35:59,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:35:59,648 INFO L93 Difference]: Finished difference Result 42194 states and 53194 transitions. [2023-12-25 07:35:59,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 07:35:59,649 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 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 61 [2023-12-25 07:35:59,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:35:59,695 INFO L225 Difference]: With dead ends: 42194 [2023-12-25 07:35:59,695 INFO L226 Difference]: Without dead ends: 32156 [2023-12-25 07:35:59,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=799, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 07:35:59,708 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 567 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 07:35:59,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 983 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 07:35:59,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32156 states. [2023-12-25 07:36:00,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32156 to 21812. [2023-12-25 07:36:00,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21812 states, 21811 states have (on average 1.2647746549906012) internal successors, (27586), 21811 states have internal predecessors, (27586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:00,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21812 states to 21812 states and 27586 transitions. [2023-12-25 07:36:00,669 INFO L78 Accepts]: Start accepts. Automaton has 21812 states and 27586 transitions. Word has length 61 [2023-12-25 07:36:00,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:00,670 INFO L495 AbstractCegarLoop]: Abstraction has 21812 states and 27586 transitions. [2023-12-25 07:36:00,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:00,670 INFO L276 IsEmpty]: Start isEmpty. Operand 21812 states and 27586 transitions. [2023-12-25 07:36:00,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 07:36:00,671 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:00,672 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:36:00,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-25 07:36:00,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:00,874 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:00,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:00,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1789610656, now seen corresponding path program 1 times [2023-12-25 07:36:00,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:00,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443233392] [2023-12-25 07:36:00,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:00,875 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:00,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:00,876 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:36:00,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-25 07:36:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:00,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:36:00,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:01,026 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:36:01,026 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:36:01,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:01,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443233392] [2023-12-25 07:36:01,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443233392] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:01,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:01,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-25 07:36:01,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87202865] [2023-12-25 07:36:01,065 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:01,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 07:36:01,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:01,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 07:36:01,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 07:36:01,067 INFO L87 Difference]: Start difference. First operand 21812 states and 27586 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:01,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:01,859 INFO L93 Difference]: Finished difference Result 27583 states and 34809 transitions. [2023-12-25 07:36:01,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 07:36:01,859 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 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 61 [2023-12-25 07:36:01,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:01,898 INFO L225 Difference]: With dead ends: 27583 [2023-12-25 07:36:01,898 INFO L226 Difference]: Without dead ends: 21468 [2023-12-25 07:36:01,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-25 07:36:01,911 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 181 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:01,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 261 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:36:01,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21468 states. [2023-12-25 07:36:02,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21468 to 18215. [2023-12-25 07:36:02,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18215 states, 18214 states have (on average 1.2659492697924672) internal successors, (23058), 18214 states have internal predecessors, (23058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:02,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18215 states to 18215 states and 23058 transitions. [2023-12-25 07:36:02,638 INFO L78 Accepts]: Start accepts. Automaton has 18215 states and 23058 transitions. Word has length 61 [2023-12-25 07:36:02,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:02,638 INFO L495 AbstractCegarLoop]: Abstraction has 18215 states and 23058 transitions. [2023-12-25 07:36:02,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:02,638 INFO L276 IsEmpty]: Start isEmpty. Operand 18215 states and 23058 transitions. [2023-12-25 07:36:02,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 07:36:02,640 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:02,640 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:36:02,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-12-25 07:36:02,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:02,845 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:02,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:02,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2040899247, now seen corresponding path program 1 times [2023-12-25 07:36:02,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:02,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893336450] [2023-12-25 07:36:02,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:02,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:02,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:02,847 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:36:02,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-25 07:36:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:02,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:36:02,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:36:03,001 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:03,050 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:36:03,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:03,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893336450] [2023-12-25 07:36:03,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893336450] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:03,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:03,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-25 07:36:03,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454593301] [2023-12-25 07:36:03,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:03,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 07:36:03,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:03,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 07:36:03,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 07:36:03,052 INFO L87 Difference]: Start difference. First operand 18215 states and 23058 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:03,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:03,815 INFO L93 Difference]: Finished difference Result 34798 states and 43877 transitions. [2023-12-25 07:36:03,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 07:36:03,815 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 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 61 [2023-12-25 07:36:03,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:03,836 INFO L225 Difference]: With dead ends: 34798 [2023-12-25 07:36:03,836 INFO L226 Difference]: Without dead ends: 17531 [2023-12-25 07:36:03,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-25 07:36:03,855 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 122 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:03,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 284 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:36:03,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17531 states. [2023-12-25 07:36:04,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17531 to 16005. [2023-12-25 07:36:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16005 states, 16004 states have (on average 1.2411897025743563) internal successors, (19864), 16004 states have internal predecessors, (19864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16005 states to 16005 states and 19864 transitions. [2023-12-25 07:36:04,588 INFO L78 Accepts]: Start accepts. Automaton has 16005 states and 19864 transitions. Word has length 61 [2023-12-25 07:36:04,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:04,589 INFO L495 AbstractCegarLoop]: Abstraction has 16005 states and 19864 transitions. [2023-12-25 07:36:04,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 16005 states and 19864 transitions. [2023-12-25 07:36:04,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 07:36:04,591 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:04,591 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:36:04,593 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 (22)] Ended with exit code 0 [2023-12-25 07:36:04,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:04,793 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:04,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:04,794 INFO L85 PathProgramCache]: Analyzing trace with hash -2005364408, now seen corresponding path program 1 times [2023-12-25 07:36:04,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:04,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284471181] [2023-12-25 07:36:04,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:04,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:04,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:04,795 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:36:04,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-25 07:36:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:04,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:36:04,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:04,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:36:04,922 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:04,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:36:04,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:04,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284471181] [2023-12-25 07:36:04,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284471181] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:04,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:04,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-25 07:36:04,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363850896] [2023-12-25 07:36:04,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:04,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 07:36:04,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:04,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 07:36:04,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 07:36:04,965 INFO L87 Difference]: Start difference. First operand 16005 states and 19864 transitions. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:05,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:05,545 INFO L93 Difference]: Finished difference Result 21312 states and 26310 transitions. [2023-12-25 07:36:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 07:36:05,546 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 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 62 [2023-12-25 07:36:05,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:05,564 INFO L225 Difference]: With dead ends: 21312 [2023-12-25 07:36:05,564 INFO L226 Difference]: Without dead ends: 15136 [2023-12-25 07:36:05,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-25 07:36:05,573 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 186 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:05,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 197 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:36:05,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15136 states. [2023-12-25 07:36:06,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15136 to 13369. [2023-12-25 07:36:06,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13369 states, 13368 states have (on average 1.2352633153800119) internal successors, (16513), 13368 states have internal predecessors, (16513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:06,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13369 states to 13369 states and 16513 transitions. [2023-12-25 07:36:06,130 INFO L78 Accepts]: Start accepts. Automaton has 13369 states and 16513 transitions. Word has length 62 [2023-12-25 07:36:06,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:06,132 INFO L495 AbstractCegarLoop]: Abstraction has 13369 states and 16513 transitions. [2023-12-25 07:36:06,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:06,132 INFO L276 IsEmpty]: Start isEmpty. Operand 13369 states and 16513 transitions. [2023-12-25 07:36:06,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-25 07:36:06,139 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:06,139 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2023-12-25 07:36:06,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-25 07:36:06,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:06,342 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:06,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:06,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1939165418, now seen corresponding path program 1 times [2023-12-25 07:36:06,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:06,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461189271] [2023-12-25 07:36:06,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:06,343 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:06,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:06,344 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:36:06,369 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 (24)] Waiting until timeout for monitored process [2023-12-25 07:36:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:06,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:36:06,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-25 07:36:06,443 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:36:06,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:06,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461189271] [2023-12-25 07:36:06,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461189271] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:36:06,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:36:06,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:36:06,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357032072] [2023-12-25 07:36:06,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:36:06,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:36:06,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:06,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:36:06,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:36:06,444 INFO L87 Difference]: Start difference. First operand 13369 states and 16513 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:06,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:06,731 INFO L93 Difference]: Finished difference Result 14145 states and 17369 transitions. [2023-12-25 07:36:06,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:36:06,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 99 [2023-12-25 07:36:06,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:06,742 INFO L225 Difference]: With dead ends: 14145 [2023-12-25 07:36:06,742 INFO L226 Difference]: Without dead ends: 9682 [2023-12-25 07:36:06,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:36:06,748 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 29 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:06,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 152 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:36:06,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9682 states. [2023-12-25 07:36:07,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9682 to 9680. [2023-12-25 07:36:07,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9680 states, 9679 states have (on average 1.2110755243310258) internal successors, (11722), 9679 states have internal predecessors, (11722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:07,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9680 states to 9680 states and 11722 transitions. [2023-12-25 07:36:07,210 INFO L78 Accepts]: Start accepts. Automaton has 9680 states and 11722 transitions. Word has length 99 [2023-12-25 07:36:07,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:07,212 INFO L495 AbstractCegarLoop]: Abstraction has 9680 states and 11722 transitions. [2023-12-25 07:36:07,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:07,212 INFO L276 IsEmpty]: Start isEmpty. Operand 9680 states and 11722 transitions. [2023-12-25 07:36:07,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-25 07:36:07,235 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:07,235 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2023-12-25 07:36:07,240 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 (24)] Forceful destruction successful, exit code 0 [2023-12-25 07:36:07,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:07,436 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:07,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:07,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1791966976, now seen corresponding path program 1 times [2023-12-25 07:36:07,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:07,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596435229] [2023-12-25 07:36:07,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:07,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:07,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:07,439 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:36:07,460 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 (25)] Waiting until timeout for monitored process [2023-12-25 07:36:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:07,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:36:07,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:07,549 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-25 07:36:07,550 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:36:07,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:07,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596435229] [2023-12-25 07:36:07,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596435229] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:36:07,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:36:07,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:36:07,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570310504] [2023-12-25 07:36:07,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:36:07,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:36:07,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:07,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:36:07,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:36:07,552 INFO L87 Difference]: Start difference. First operand 9680 states and 11722 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:07,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:07,854 INFO L93 Difference]: Finished difference Result 18090 states and 21995 transitions. [2023-12-25 07:36:07,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:36:07,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 100 [2023-12-25 07:36:07,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:07,865 INFO L225 Difference]: With dead ends: 18090 [2023-12-25 07:36:07,865 INFO L226 Difference]: Without dead ends: 9437 [2023-12-25 07:36:07,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:36:07,874 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 34 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:07,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 156 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:36:07,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9437 states. [2023-12-25 07:36:08,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9437 to 7825. [2023-12-25 07:36:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7825 states, 7824 states have (on average 1.1891615541922291) internal successors, (9304), 7824 states have internal predecessors, (9304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7825 states to 7825 states and 9304 transitions. [2023-12-25 07:36:08,190 INFO L78 Accepts]: Start accepts. Automaton has 7825 states and 9304 transitions. Word has length 100 [2023-12-25 07:36:08,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:08,190 INFO L495 AbstractCegarLoop]: Abstraction has 7825 states and 9304 transitions. [2023-12-25 07:36:08,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:08,191 INFO L276 IsEmpty]: Start isEmpty. Operand 7825 states and 9304 transitions. [2023-12-25 07:36:08,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-25 07:36:08,194 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:08,195 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:36:08,212 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 (25)] Forceful destruction successful, exit code 0 [2023-12-25 07:36:08,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:08,398 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:08,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:08,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1110967071, now seen corresponding path program 1 times [2023-12-25 07:36:08,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:08,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325665132] [2023-12-25 07:36:08,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:08,400 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:08,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:08,401 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:36:08,403 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 (26)] Waiting until timeout for monitored process [2023-12-25 07:36:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:08,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:36:08,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 07:36:08,508 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:36:08,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:08,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325665132] [2023-12-25 07:36:08,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325665132] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:36:08,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:36:08,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:36:08,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995688440] [2023-12-25 07:36:08,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:36:08,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:36:08,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:08,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:36:08,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:36:08,518 INFO L87 Difference]: Start difference. First operand 7825 states and 9304 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:08,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:08,831 INFO L93 Difference]: Finished difference Result 10015 states and 11894 transitions. [2023-12-25 07:36:08,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:36:08,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 100 [2023-12-25 07:36:08,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:08,837 INFO L225 Difference]: With dead ends: 10015 [2023-12-25 07:36:08,837 INFO L226 Difference]: Without dead ends: 5630 [2023-12-25 07:36:08,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:36:08,842 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 26 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:08,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 197 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:36:08,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2023-12-25 07:36:09,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 4350. [2023-12-25 07:36:09,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4350 states, 4349 states have (on average 1.168774430903656) internal successors, (5083), 4349 states have internal predecessors, (5083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:09,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4350 states to 4350 states and 5083 transitions. [2023-12-25 07:36:09,062 INFO L78 Accepts]: Start accepts. Automaton has 4350 states and 5083 transitions. Word has length 100 [2023-12-25 07:36:09,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:09,062 INFO L495 AbstractCegarLoop]: Abstraction has 4350 states and 5083 transitions. [2023-12-25 07:36:09,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:09,062 INFO L276 IsEmpty]: Start isEmpty. Operand 4350 states and 5083 transitions. [2023-12-25 07:36:09,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-25 07:36:09,064 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:09,064 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2023-12-25 07:36:09,069 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 (26)] Forceful destruction successful, exit code 0 [2023-12-25 07:36:09,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:09,267 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:09,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:09,267 INFO L85 PathProgramCache]: Analyzing trace with hash 180074091, now seen corresponding path program 1 times [2023-12-25 07:36:09,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:09,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696592578] [2023-12-25 07:36:09,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:09,267 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:09,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:09,269 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:36:09,282 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 (27)] Waiting until timeout for monitored process [2023-12-25 07:36:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:09,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:36:09,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:09,367 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 07:36:09,367 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:36:09,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:09,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696592578] [2023-12-25 07:36:09,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696592578] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:36:09,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:36:09,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:36:09,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492131806] [2023-12-25 07:36:09,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:36:09,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:36:09,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:09,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:36:09,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:36:09,368 INFO L87 Difference]: Start difference. First operand 4350 states and 5083 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:09,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:09,510 INFO L93 Difference]: Finished difference Result 5480 states and 6376 transitions. [2023-12-25 07:36:09,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:36:09,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 102 [2023-12-25 07:36:09,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:09,514 INFO L225 Difference]: With dead ends: 5480 [2023-12-25 07:36:09,514 INFO L226 Difference]: Without dead ends: 3932 [2023-12-25 07:36:09,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:36:09,516 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 25 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:09,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 183 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:36:09,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3932 states. [2023-12-25 07:36:09,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3932 to 3824. [2023-12-25 07:36:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3824 states, 3823 states have (on average 1.1375882814543552) internal successors, (4349), 3823 states have internal predecessors, (4349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:09,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 4349 transitions. [2023-12-25 07:36:09,667 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 4349 transitions. Word has length 102 [2023-12-25 07:36:09,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:09,668 INFO L495 AbstractCegarLoop]: Abstraction has 3824 states and 4349 transitions. [2023-12-25 07:36:09,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:09,668 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 4349 transitions. [2023-12-25 07:36:09,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-25 07:36:09,669 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:09,669 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2023-12-25 07:36:09,671 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 (27)] Ended with exit code 0 [2023-12-25 07:36:09,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:09,872 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:09,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:09,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2038895169, now seen corresponding path program 1 times [2023-12-25 07:36:09,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:09,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675180922] [2023-12-25 07:36:09,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:09,873 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:09,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:09,874 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:36:09,876 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 (28)] Waiting until timeout for monitored process [2023-12-25 07:36:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:09,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:36:09,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:36:10,876 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:11,353 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:36:11,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:11,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675180922] [2023-12-25 07:36:11,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [675180922] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:11,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:11,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-25 07:36:11,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775691949] [2023-12-25 07:36:11,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:11,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:36:11,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:11,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:36:11,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:36:11,357 INFO L87 Difference]: Start difference. First operand 3824 states and 4349 transitions. Second operand has 26 states, 26 states have (on average 7.269230769230769) internal successors, (189), 26 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:17,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:17,135 INFO L93 Difference]: Finished difference Result 7168 states and 8133 transitions. [2023-12-25 07:36:17,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-12-25 07:36:17,136 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.269230769230769) internal successors, (189), 26 states have internal predecessors, (189), 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 103 [2023-12-25 07:36:17,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:17,141 INFO L225 Difference]: With dead ends: 7168 [2023-12-25 07:36:17,141 INFO L226 Difference]: Without dead ends: 6288 [2023-12-25 07:36:17,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2024 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1381, Invalid=6629, Unknown=0, NotChecked=0, Total=8010 [2023-12-25 07:36:17,145 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 1082 mSDsluCounter, 2617 mSDsCounter, 0 mSdLazyCounter, 2747 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 2800 SdHoareTripleChecker+Invalid, 2784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:17,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1082 Valid, 2800 Invalid, 2784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2747 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-25 07:36:17,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6288 states. [2023-12-25 07:36:17,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6288 to 3728. [2023-12-25 07:36:17,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3728 states, 3727 states have (on average 1.1330829085055003) internal successors, (4223), 3727 states have internal predecessors, (4223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:17,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3728 states to 3728 states and 4223 transitions. [2023-12-25 07:36:17,316 INFO L78 Accepts]: Start accepts. Automaton has 3728 states and 4223 transitions. Word has length 103 [2023-12-25 07:36:17,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:17,316 INFO L495 AbstractCegarLoop]: Abstraction has 3728 states and 4223 transitions. [2023-12-25 07:36:17,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.269230769230769) internal successors, (189), 26 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:17,317 INFO L276 IsEmpty]: Start isEmpty. Operand 3728 states and 4223 transitions. [2023-12-25 07:36:17,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-25 07:36:17,318 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:17,318 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2023-12-25 07:36:17,320 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 (28)] Ended with exit code 0 [2023-12-25 07:36:17,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:17,520 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:17,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:17,521 INFO L85 PathProgramCache]: Analyzing trace with hash 571342120, now seen corresponding path program 1 times [2023-12-25 07:36:17,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:17,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235889008] [2023-12-25 07:36:17,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:17,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:17,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:17,522 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:36:17,523 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 (29)] Waiting until timeout for monitored process [2023-12-25 07:36:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:17,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:36:17,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:18,527 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 13 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:36:18,528 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 13 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:36:18,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:18,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235889008] [2023-12-25 07:36:18,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235889008] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:18,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:18,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-25 07:36:18,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228408714] [2023-12-25 07:36:18,943 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:18,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:36:18,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:18,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:36:18,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:36:18,944 INFO L87 Difference]: Start difference. First operand 3728 states and 4223 transitions. Second operand has 26 states, 26 states have (on average 7.6923076923076925) internal successors, (200), 26 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-25 07:36:24,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:24,501 INFO L93 Difference]: Finished difference Result 8143 states and 9280 transitions. [2023-12-25 07:36:24,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2023-12-25 07:36:24,502 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.6923076923076925) internal successors, (200), 26 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) Word has length 103 [2023-12-25 07:36:24,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:24,508 INFO L225 Difference]: With dead ends: 8143 [2023-12-25 07:36:24,508 INFO L226 Difference]: Without dead ends: 6991 [2023-12-25 07:36:24,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2160 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1335, Invalid=7037, Unknown=0, NotChecked=0, Total=8372 [2023-12-25 07:36:24,511 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 1249 mSDsluCounter, 1914 mSDsCounter, 0 mSdLazyCounter, 2059 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1249 SdHoareTripleChecker+Valid, 2092 SdHoareTripleChecker+Invalid, 2101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:24,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1249 Valid, 2092 Invalid, 2101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2059 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-25 07:36:24,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6991 states. [2023-12-25 07:36:24,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6991 to 5260. [2023-12-25 07:36:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5260 states, 5259 states have (on average 1.1342460543829624) internal successors, (5965), 5259 states have internal predecessors, (5965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:24,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5260 states to 5260 states and 5965 transitions. [2023-12-25 07:36:24,752 INFO L78 Accepts]: Start accepts. Automaton has 5260 states and 5965 transitions. Word has length 103 [2023-12-25 07:36:24,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:24,752 INFO L495 AbstractCegarLoop]: Abstraction has 5260 states and 5965 transitions. [2023-12-25 07:36:24,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.6923076923076925) internal successors, (200), 26 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-25 07:36:24,752 INFO L276 IsEmpty]: Start isEmpty. Operand 5260 states and 5965 transitions. [2023-12-25 07:36:24,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-25 07:36:24,753 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:24,753 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:36:24,756 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 (29)] Forceful destruction successful, exit code 0 [2023-12-25 07:36:24,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:24,957 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:24,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:24,957 INFO L85 PathProgramCache]: Analyzing trace with hash -89237700, now seen corresponding path program 1 times [2023-12-25 07:36:24,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:24,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766696379] [2023-12-25 07:36:24,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:24,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:24,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:24,958 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:36:24,960 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 (30)] Waiting until timeout for monitored process [2023-12-25 07:36:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:25,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:36:25,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:25,964 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 23 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:36:25,964 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 23 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:36:26,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:26,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766696379] [2023-12-25 07:36:26,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766696379] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:26,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:26,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-25 07:36:26,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339455251] [2023-12-25 07:36:26,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:26,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:36:26,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:26,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:36:26,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:36:26,427 INFO L87 Difference]: Start difference. First operand 5260 states and 5965 transitions. Second operand has 26 states, 26 states have (on average 7.615384615384615) internal successors, (198), 26 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:31,065 INFO L93 Difference]: Finished difference Result 8495 states and 9587 transitions. [2023-12-25 07:36:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-12-25 07:36:31,065 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.615384615384615) internal successors, (198), 26 states have internal predecessors, (198), 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 105 [2023-12-25 07:36:31,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:31,072 INFO L225 Difference]: With dead ends: 8495 [2023-12-25 07:36:31,072 INFO L226 Difference]: Without dead ends: 8096 [2023-12-25 07:36:31,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=962, Invalid=4588, Unknown=0, NotChecked=0, Total=5550 [2023-12-25 07:36:31,080 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 744 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 2360 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 2382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:31,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 2523 Invalid, 2382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2360 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-25 07:36:31,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8096 states. [2023-12-25 07:36:31,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8096 to 6586. [2023-12-25 07:36:31,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6586 states, 6585 states have (on average 1.1315110098709187) internal successors, (7451), 6585 states have internal predecessors, (7451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:31,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6586 states to 6586 states and 7451 transitions. [2023-12-25 07:36:31,396 INFO L78 Accepts]: Start accepts. Automaton has 6586 states and 7451 transitions. Word has length 105 [2023-12-25 07:36:31,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:31,397 INFO L495 AbstractCegarLoop]: Abstraction has 6586 states and 7451 transitions. [2023-12-25 07:36:31,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.615384615384615) internal successors, (198), 26 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 6586 states and 7451 transitions. [2023-12-25 07:36:31,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-25 07:36:31,400 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:31,400 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:36:31,403 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 (30)] Forceful destruction successful, exit code 0 [2023-12-25 07:36:31,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:31,603 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:31,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:31,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1606776377, now seen corresponding path program 2 times [2023-12-25 07:36:31,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:31,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816214581] [2023-12-25 07:36:31,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 07:36:31,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:31,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:31,605 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:36:31,606 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 (31)] Waiting until timeout for monitored process [2023-12-25 07:36:31,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 07:36:31,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 07:36:31,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 07:36:31,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:32,141 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 128 proven. 30 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-12-25 07:36:32,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:36:32,343 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 128 proven. 30 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-12-25 07:36:32,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:32,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816214581] [2023-12-25 07:36:32,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816214581] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:36:32,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:36:32,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2023-12-25 07:36:32,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461275322] [2023-12-25 07:36:32,343 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:36:32,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 07:36:32,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:32,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 07:36:32,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-12-25 07:36:32,344 INFO L87 Difference]: Start difference. First operand 6586 states and 7451 transitions. Second operand has 18 states, 18 states have (on average 9.722222222222221) internal successors, (175), 18 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:34,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:34,335 INFO L93 Difference]: Finished difference Result 9279 states and 10521 transitions. [2023-12-25 07:36:34,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-25 07:36:34,335 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 9.722222222222221) internal successors, (175), 18 states have internal predecessors, (175), 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 136 [2023-12-25 07:36:34,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:34,341 INFO L225 Difference]: With dead ends: 9279 [2023-12-25 07:36:34,341 INFO L226 Difference]: Without dead ends: 7301 [2023-12-25 07:36:34,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=392, Invalid=1414, Unknown=0, NotChecked=0, Total=1806 [2023-12-25 07:36:34,343 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 617 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:34,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 1326 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-25 07:36:34,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7301 states. [2023-12-25 07:36:34,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7301 to 6756. [2023-12-25 07:36:34,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6756 states, 6755 states have (on average 1.1284974093264248) internal successors, (7623), 6755 states have internal predecessors, (7623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:34,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6756 states to 6756 states and 7623 transitions. [2023-12-25 07:36:34,662 INFO L78 Accepts]: Start accepts. Automaton has 6756 states and 7623 transitions. Word has length 136 [2023-12-25 07:36:34,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:34,662 INFO L495 AbstractCegarLoop]: Abstraction has 6756 states and 7623 transitions. [2023-12-25 07:36:34,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.722222222222221) internal successors, (175), 18 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:34,662 INFO L276 IsEmpty]: Start isEmpty. Operand 6756 states and 7623 transitions. [2023-12-25 07:36:34,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-25 07:36:34,665 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:34,666 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:36:34,670 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 (31)] Forceful destruction successful, exit code 0 [2023-12-25 07:36:34,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:34,869 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:34,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:34,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1209784893, now seen corresponding path program 1 times [2023-12-25 07:36:34,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:34,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759972363] [2023-12-25 07:36:34,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:34,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:34,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:34,870 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:36:34,871 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 (32)] Waiting until timeout for monitored process [2023-12-25 07:36:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:36:34,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:36:34,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:36:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 07:36:35,082 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:36:35,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:36:35,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759972363] [2023-12-25 07:36:35,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759972363] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:36:35,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:36:35,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:36:35,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582433425] [2023-12-25 07:36:35,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:36:35,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:36:35,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:36:35,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:36:35,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:36:35,083 INFO L87 Difference]: Start difference. First operand 6756 states and 7623 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:35,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:36:35,390 INFO L93 Difference]: Finished difference Result 6762 states and 7626 transitions. [2023-12-25 07:36:35,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:36:35,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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 136 [2023-12-25 07:36:35,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:36:35,396 INFO L225 Difference]: With dead ends: 6762 [2023-12-25 07:36:35,397 INFO L226 Difference]: Without dead ends: 6637 [2023-12-25 07:36:35,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:36:35,398 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 102 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:36:35,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 177 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:36:35,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6637 states. [2023-12-25 07:36:35,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6637 to 6633. [2023-12-25 07:36:35,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6633 states, 6632 states have (on average 1.1301266586248493) internal successors, (7495), 6632 states have internal predecessors, (7495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:35,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6633 states to 6633 states and 7495 transitions. [2023-12-25 07:36:35,734 INFO L78 Accepts]: Start accepts. Automaton has 6633 states and 7495 transitions. Word has length 136 [2023-12-25 07:36:35,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:36:35,734 INFO L495 AbstractCegarLoop]: Abstraction has 6633 states and 7495 transitions. [2023-12-25 07:36:35,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:36:35,734 INFO L276 IsEmpty]: Start isEmpty. Operand 6633 states and 7495 transitions. [2023-12-25 07:36:35,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-25 07:36:35,738 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:36:35,738 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:36:35,740 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 (32)] Forceful destruction successful, exit code 0 [2023-12-25 07:36:35,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:35,944 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:36:35,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:36:35,944 INFO L85 PathProgramCache]: Analyzing trace with hash -206448956, now seen corresponding path program 1 times [2023-12-25 07:36:35,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:36:35,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272798311] [2023-12-25 07:36:35,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:36:35,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:35,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:36:35,948 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:36:35,949 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 (33)] Waiting until timeout for monitored process [2023-12-25 07:36:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 07:36:36,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 07:36:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 07:36:36,171 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 07:36:36,171 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 07:36:36,171 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 07:36:36,190 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 (33)] Forceful destruction successful, exit code 0 [2023-12-25 07:36:36,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:36:36,380 INFO L445 BasicCegarLoop]: Path program histogram: [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] [2023-12-25 07:36:36,383 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 07:36:36,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 07:36:36 BoogieIcfgContainer [2023-12-25 07:36:36,491 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 07:36:36,491 INFO L158 Benchmark]: Toolchain (without parser) took 57280.75ms. Allocated memory was 247.5MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 193.4MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2023-12-25 07:36:36,491 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 176.2MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 07:36:36,492 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.61ms. Allocated memory is still 247.5MB. Free memory was 192.9MB in the beginning and 178.8MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 07:36:36,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.85ms. Allocated memory is still 247.5MB. Free memory was 178.8MB in the beginning and 176.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 07:36:36,494 INFO L158 Benchmark]: Boogie Preprocessor took 42.59ms. Allocated memory is still 247.5MB. Free memory was 176.1MB in the beginning and 173.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 07:36:36,494 INFO L158 Benchmark]: RCFGBuilder took 343.01ms. Allocated memory is still 247.5MB. Free memory was 173.5MB in the beginning and 150.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-25 07:36:36,497 INFO L158 Benchmark]: TraceAbstraction took 56532.47ms. Allocated memory was 247.5MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 149.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2023-12-25 07:36:36,500 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.76ms. Allocated memory is still 176.2MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 289.61ms. Allocated memory is still 247.5MB. Free memory was 192.9MB in the beginning and 178.8MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.85ms. Allocated memory is still 247.5MB. Free memory was 178.8MB in the beginning and 176.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.59ms. Allocated memory is still 247.5MB. Free memory was 176.1MB in the beginning and 173.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 343.01ms. Allocated memory is still 247.5MB. Free memory was 173.5MB in the beginning and 150.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 56532.47ms. Allocated memory was 247.5MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 149.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 306]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] msg_t nomsg = (msg_t )-1; [L26] char r1 ; [L27] port_t p1 ; [L28] char p1_old ; [L29] char p1_new ; [L30] char id1 ; [L31] char st1 ; [L32] msg_t send1 ; [L33] _Bool mode1 ; [L34] _Bool alive1 ; [L35] port_t p2 ; [L36] char p2_old ; [L37] char p2_new ; [L38] char id2 ; [L39] char st2 ; [L40] msg_t send2 ; [L41] _Bool mode2 ; [L42] _Bool alive2 ; [L43] port_t p3 ; [L44] char p3_old ; [L45] char p3_new ; [L46] char id3 ; [L47] char st3 ; [L48] msg_t send3 ; [L49] _Bool mode3 ; [L50] _Bool alive3 ; [L250] int c1 ; [L251] int i2 ; [L254] c1 = 0 [L255] r1 = __VERIFIER_nondet_char() [L256] id1 = __VERIFIER_nondet_char() [L257] st1 = __VERIFIER_nondet_char() [L258] send1 = __VERIFIER_nondet_char() [L259] mode1 = __VERIFIER_nondet_bool() [L260] alive1 = __VERIFIER_nondet_bool() [L261] id2 = __VERIFIER_nondet_char() [L262] st2 = __VERIFIER_nondet_char() [L263] send2 = __VERIFIER_nondet_char() [L264] mode2 = __VERIFIER_nondet_bool() [L265] alive2 = __VERIFIER_nondet_bool() [L266] id3 = __VERIFIER_nondet_char() [L267] st3 = __VERIFIER_nondet_char() [L268] send3 = __VERIFIER_nondet_char() [L269] mode3 = __VERIFIER_nondet_bool() [L270] alive3 = __VERIFIER_nondet_bool() [L271] CALL, EXPR init() [L153] int tmp ; VAL [nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0] [L156] COND TRUE (int )r1 == 0 VAL [nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0] [L157] COND TRUE ((int )alive1 + (int )alive2) + (int )alive3 >= 1 VAL [alive1=0, alive2=0, alive3=1, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0] [L158] COND TRUE (int )id1 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0] [L159] COND TRUE (int )st1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, st1=0] [L160] COND TRUE (int )send1 == (int )id1 VAL [alive1=0, alive2=0, alive3=1, id1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, st1=0] [L161] COND TRUE (int )mode1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, st1=0] [L162] COND TRUE (int )id2 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, st1=0] [L163] COND TRUE (int )st2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, st1=0, st2=0] [L164] COND TRUE (int )send2 == (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, st1=0, st2=0] [L165] COND TRUE (int )mode2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, st1=0, st2=0] [L166] COND TRUE (int )id3 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, st1=0, st2=0] [L167] COND TRUE (int )st3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, st1=0, st2=0, st3=0] [L168] COND TRUE (int )send3 == (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L169] COND TRUE (int )mode3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L170] COND TRUE (int )id1 != (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L171] COND TRUE (int )id1 != (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L172] COND TRUE (int )id2 != (int )id3 [L173] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0, tmp=1] [L225] return (tmp); [L271] RET, EXPR init() [L271] i2 = init() [L272] COND FALSE !(!(i2)) VAL [alive1=0, alive2=0, alive3=1, c1=0, i2=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L273] p1_old = nomsg [L274] p1_new = nomsg [L275] p2_old = nomsg [L276] p2_new = nomsg [L277] p3_old = nomsg [L278] p3_new = nomsg [L279] i2 = 0 VAL [alive1=0, alive2=0, alive3=1, c1=0, i2=0, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L57] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L75] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L78] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L89] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L106] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L109] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L112] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L140] COND TRUE \read(alive3) [L141] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L146] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, c1=1, i2=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L57] COND TRUE \read(mode1) [L58] r1 = (char )((int )r1 + 1) [L59] m1 = p3_old [L60] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L61] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L62] COND FALSE !(\read(alive1)) [L70] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L73] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L89] COND TRUE \read(mode2) [L90] m2 = p1_old [L91] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L92] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L104] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L126] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L138] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, c1=1, i2=2, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L57] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L75] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L78] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L89] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L106] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L109] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L112] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L140] COND TRUE \read(alive3) [L141] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L146] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, c1=1, i2=3, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L57] COND TRUE \read(mode1) [L58] r1 = (char )((int )r1 + 1) [L59] m1 = p3_old [L60] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L61] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L62] COND FALSE !(\read(alive1)) [L70] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L73] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L89] COND TRUE \read(mode2) [L90] m2 = p1_old [L91] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L92] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L104] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L126] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L138] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, c1=1, i2=4, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L57] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L75] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L78] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L89] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L106] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L109] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L112] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L140] COND TRUE \read(alive3) [L141] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L146] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0, tmp=1] [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [\old(arg)=1, alive1=0, alive2=0, alive3=1, arg=1, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, c1=1, i2=5, id1=0, id2=64, id3=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L57] COND TRUE \read(mode1) [L58] r1 = (char )((int )r1 + 1) [L59] m1 = p3_old [L60] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L61] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L62] COND FALSE !(\read(alive1)) [L70] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L73] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m1=96, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L89] COND TRUE \read(mode2) [L90] m2 = p1_old [L91] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L92] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L104] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m2=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L126] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L138] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, m3=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L234] COND FALSE !((int )r1 < 3) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L237] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 1) [L240] tmp = 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0, tmp=0] [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND TRUE ! arg VAL [\old(arg)=0, alive1=0, alive2=0, alive3=1, arg=0, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L306] reach_error() VAL [\old(arg)=0, alive1=0, alive2=0, alive3=1, arg=0, id1=0, id2=64, id3=96, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.4s, OverallIterations: 32, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 29.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9885 SdHoareTripleChecker+Valid, 9.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9885 mSDsluCounter, 16895 SdHoareTripleChecker+Invalid, 8.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13692 mSDsCounter, 271 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11932 IncrementalHoareTripleChecker+Invalid, 12203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 271 mSolverCounterUnsat, 3203 mSDtfsCounter, 11932 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3450 GetRequests, 2922 SyntacticMatches, 0 SemanticMatches, 528 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6859 ImplicationChecksByTransitivity, 14.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21812occurred in iteration=19, InterpolantAutomatonStates: 429, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 42626 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 2274 NumberOfCodeBlocks, 2274 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 3142 ConstructedInterpolants, 563 QuantifiedInterpolants, 25575 SizeOfPredicates, 85 NumberOfNonLiveVariables, 4226 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 45 InterpolantComputations, 17 PerfectInterpolantSequences, 1226/1732 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-25 07:36:36,554 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...