/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/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 23:37:14,338 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 23:37:14,398 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-21 23:37:14,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 23:37:14,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 23:37:14,423 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 23:37:14,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 23:37:14,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 23:37:14,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 23:37:14,427 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 23:37:14,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 23:37:14,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 23:37:14,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 23:37:14,428 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 23:37:14,428 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 23:37:14,429 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 23:37:14,429 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 23:37:14,429 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 23:37:14,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 23:37:14,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 23:37:14,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 23:37:14,431 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 23:37:14,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 23:37:14,431 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 23:37:14,431 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 23:37:14,431 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 23:37:14,431 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 23:37:14,431 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 23:37:14,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 23:37:14,432 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 23:37:14,433 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 23:37:14,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 23:37:14,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 23:37:14,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 23:37:14,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 23:37:14,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 23:37:14,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 23:37:14,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 23:37:14,434 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 23:37:14,434 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 23:37:14,434 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 23:37:14,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 23:37:14,434 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 23:37:14,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 23:37:14,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 23:37:14,435 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 23:37:14,435 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-21 23:37:14,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 23:37:14,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 23:37:14,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 23:37:14,644 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 23:37:14,644 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 23:37:14,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c [2023-12-21 23:37:15,677 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 23:37:16,048 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 23:37:16,049 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c [2023-12-21 23:37:16,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40ab650ea/d7a180d48c2d4e0fa81c322c16c199a8/FLAG74ef526a6 [2023-12-21 23:37:16,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40ab650ea/d7a180d48c2d4e0fa81c322c16c199a8 [2023-12-21 23:37:16,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 23:37:16,093 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 23:37:16,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 23:37:16,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 23:37:16,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 23:37:16,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:37:16" (1/1) ... [2023-12-21 23:37:16,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35445f60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:16, skipping insertion in model container [2023-12-21 23:37:16,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:37:16" (1/1) ... [2023-12-21 23:37:16,196 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 23:37:16,447 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c[6391,6404] [2023-12-21 23:37:16,493 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c[13452,13465] [2023-12-21 23:37:17,022 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 23:37:17,032 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 23:37:17,060 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c[6391,6404] [2023-12-21 23:37:17,071 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c[13452,13465] [2023-12-21 23:37:17,375 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 23:37:17,393 INFO L206 MainTranslator]: Completed translation [2023-12-21 23:37:17,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:17 WrapperNode [2023-12-21 23:37:17,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 23:37:17,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 23:37:17,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 23:37:17,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 23:37:17,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:17" (1/1) ... [2023-12-21 23:37:17,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:17" (1/1) ... [2023-12-21 23:37:17,546 INFO L138 Inliner]: procedures = 34, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4962 [2023-12-21 23:37:17,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 23:37:17,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 23:37:17,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 23:37:17,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 23:37:17,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:17" (1/1) ... [2023-12-21 23:37:17,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:17" (1/1) ... [2023-12-21 23:37:17,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:17" (1/1) ... [2023-12-21 23:37:17,647 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-21 23:37:17,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:17" (1/1) ... [2023-12-21 23:37:17,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:17" (1/1) ... [2023-12-21 23:37:17,713 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:17" (1/1) ... [2023-12-21 23:37:17,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:17" (1/1) ... [2023-12-21 23:37:17,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:17" (1/1) ... [2023-12-21 23:37:17,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:17" (1/1) ... [2023-12-21 23:37:17,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 23:37:17,787 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 23:37:17,787 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 23:37:17,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 23:37:17,788 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:17" (1/1) ... [2023-12-21 23:37:17,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 23:37:17,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 23:37:17,809 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-21 23:37:17,816 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-21 23:37:17,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 23:37:17,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 23:37:17,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 23:37:17,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 23:37:17,891 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 23:37:17,892 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 23:37:42,490 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 23:37:42,552 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 23:37:42,553 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-21 23:37:42,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:37:42 BoogieIcfgContainer [2023-12-21 23:37:42,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 23:37:42,554 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 23:37:42,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 23:37:42,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 23:37:42,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 11:37:16" (1/3) ... [2023-12-21 23:37:42,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8220d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:37:42, skipping insertion in model container [2023-12-21 23:37:42,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:17" (2/3) ... [2023-12-21 23:37:42,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8220d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:37:42, skipping insertion in model container [2023-12-21 23:37:42,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:37:42" (3/3) ... [2023-12-21 23:37:42,565 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c [2023-12-21 23:37:42,579 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 23:37:42,580 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-21 23:37:42,641 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 23:37:42,645 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;@60c29ae6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 23:37:42,645 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-21 23:37:42,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 807 states, 804 states have (on average 1.9800995024875623) internal successors, (1592), 806 states have internal predecessors, (1592), 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-21 23:37:42,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 23:37:42,656 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:42,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:37:42,656 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:42,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:42,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1100216757, now seen corresponding path program 1 times [2023-12-21 23:37:42,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:42,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824869516] [2023-12-21 23:37:42,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:42,668 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-21 23:37:42,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:42,670 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-21 23:37:42,680 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-21 23:37:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:42,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 23:37:42,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:42,755 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-21 23:37:42,755 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:42,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:42,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824869516] [2023-12-21 23:37:42,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824869516] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:42,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:42,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 23:37:42,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219971282] [2023-12-21 23:37:42,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:42,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 23:37:42,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:42,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 23:37:42,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 23:37:42,779 INFO L87 Difference]: Start difference. First operand has 807 states, 804 states have (on average 1.9800995024875623) internal successors, (1592), 806 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-21 23:37:42,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:42,844 INFO L93 Difference]: Finished difference Result 1594 states and 3146 transitions. [2023-12-21 23:37:42,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 23:37:42,846 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 17 [2023-12-21 23:37:42,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:42,857 INFO L225 Difference]: With dead ends: 1594 [2023-12-21 23:37:42,857 INFO L226 Difference]: Without dead ends: 803 [2023-12-21 23:37:42,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 23:37:42,863 INFO L413 NwaCegarLoop]: 1521 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:42,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1521 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:37:42,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2023-12-21 23:37:42,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2023-12-21 23:37:42,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 801 states have (on average 1.898876404494382) internal successors, (1521), 802 states have internal predecessors, (1521), 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-21 23:37:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1521 transitions. [2023-12-21 23:37:42,938 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1521 transitions. Word has length 17 [2023-12-21 23:37:42,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:42,939 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1521 transitions. [2023-12-21 23:37:42,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-21 23:37:42,939 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1521 transitions. [2023-12-21 23:37:42,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 23:37:42,940 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:42,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:37:42,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-21 23:37:43,143 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-21 23:37:43,144 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:43,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:43,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1687022771, now seen corresponding path program 1 times [2023-12-21 23:37:43,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:43,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021349072] [2023-12-21 23:37:43,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:43,146 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-21 23:37:43,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:43,149 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-21 23:37:43,179 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-21 23:37:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:43,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:37:43,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:43,232 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-21 23:37:43,232 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:43,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:43,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021349072] [2023-12-21 23:37:43,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021349072] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:43,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:43,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 23:37:43,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421509384] [2023-12-21 23:37:43,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:43,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 23:37:43,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:43,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 23:37:43,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 23:37:43,235 INFO L87 Difference]: Start difference. First operand 803 states and 1521 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-21 23:37:43,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:43,288 INFO L93 Difference]: Finished difference Result 864 states and 1616 transitions. [2023-12-21 23:37:43,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 23:37:43,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2023-12-21 23:37:43,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:43,292 INFO L225 Difference]: With dead ends: 864 [2023-12-21 23:37:43,292 INFO L226 Difference]: Without dead ends: 832 [2023-12-21 23:37:43,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-21 23:37:43,294 INFO L413 NwaCegarLoop]: 1516 mSDtfsCounter, 45 mSDsluCounter, 3011 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4527 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:43,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4527 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:37:43,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2023-12-21 23:37:43,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 803. [2023-12-21 23:37:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 801 states have (on average 1.8789013732833957) internal successors, (1505), 802 states have internal predecessors, (1505), 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-21 23:37:43,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1505 transitions. [2023-12-21 23:37:43,304 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1505 transitions. Word has length 17 [2023-12-21 23:37:43,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:43,304 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1505 transitions. [2023-12-21 23:37:43,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-21 23:37:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1505 transitions. [2023-12-21 23:37:43,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-21 23:37:43,305 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:43,305 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] [2023-12-21 23:37:43,313 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-21 23:37:43,508 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-21 23:37:43,509 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:43,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:43,510 INFO L85 PathProgramCache]: Analyzing trace with hash 613121839, now seen corresponding path program 1 times [2023-12-21 23:37:43,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:43,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962573696] [2023-12-21 23:37:43,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:43,510 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-21 23:37:43,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:43,518 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-21 23:37:43,520 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-21 23:37:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:43,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:37:43,573 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:43,800 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-21 23:37:43,800 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:43,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:43,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962573696] [2023-12-21 23:37:43,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962573696] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:43,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:43,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 23:37:43,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160822706] [2023-12-21 23:37:43,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:43,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 23:37:43,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:43,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 23:37:43,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:37:43,805 INFO L87 Difference]: Start difference. First operand 803 states and 1505 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-21 23:37:43,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:43,913 INFO L93 Difference]: Finished difference Result 919 states and 1689 transitions. [2023-12-21 23:37:43,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:37:43,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 32 [2023-12-21 23:37:43,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:43,919 INFO L225 Difference]: With dead ends: 919 [2023-12-21 23:37:43,919 INFO L226 Difference]: Without dead ends: 890 [2023-12-21 23:37:43,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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-21 23:37:43,922 INFO L413 NwaCegarLoop]: 1499 mSDtfsCounter, 3033 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3033 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:43,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3033 Valid, 1656 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 23:37:43,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2023-12-21 23:37:43,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 857. [2023-12-21 23:37:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 855 states have (on average 1.8619883040935672) internal successors, (1592), 856 states have internal predecessors, (1592), 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-21 23:37:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1592 transitions. [2023-12-21 23:37:43,935 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1592 transitions. Word has length 32 [2023-12-21 23:37:43,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:43,936 INFO L495 AbstractCegarLoop]: Abstraction has 857 states and 1592 transitions. [2023-12-21 23:37:43,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-21 23:37:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1592 transitions. [2023-12-21 23:37:43,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 23:37:43,940 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:43,940 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] [2023-12-21 23:37:43,945 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 (4)] Ended with exit code 0 [2023-12-21 23:37:44,142 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-21 23:37:44,143 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:44,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:44,146 INFO L85 PathProgramCache]: Analyzing trace with hash 675954815, now seen corresponding path program 1 times [2023-12-21 23:37:44,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:44,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840383312] [2023-12-21 23:37:44,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:44,147 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-21 23:37:44,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:44,148 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-21 23:37:44,151 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-21 23:37:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:44,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:44,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:44,248 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-21 23:37:44,248 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:44,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:44,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840383312] [2023-12-21 23:37:44,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840383312] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:44,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:44,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:37:44,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752771624] [2023-12-21 23:37:44,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:44,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:44,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:44,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:44,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:44,250 INFO L87 Difference]: Start difference. First operand 857 states and 1592 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-21 23:37:44,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:44,280 INFO L93 Difference]: Finished difference Result 1007 states and 1830 transitions. [2023-12-21 23:37:44,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:37:44,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2023-12-21 23:37:44,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:44,284 INFO L225 Difference]: With dead ends: 1007 [2023-12-21 23:37:44,284 INFO L226 Difference]: Without dead ends: 924 [2023-12-21 23:37:44,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-21 23:37:44,285 INFO L413 NwaCegarLoop]: 1501 mSDtfsCounter, 1464 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:44,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1541 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:37:44,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2023-12-21 23:37:44,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 922. [2023-12-21 23:37:44,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 920 states have (on average 1.8380434782608697) internal successors, (1691), 921 states have internal predecessors, (1691), 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-21 23:37:44,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1691 transitions. [2023-12-21 23:37:44,297 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1691 transitions. Word has length 34 [2023-12-21 23:37:44,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:44,297 INFO L495 AbstractCegarLoop]: Abstraction has 922 states and 1691 transitions. [2023-12-21 23:37:44,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-21 23:37:44,297 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1691 transitions. [2023-12-21 23:37:44,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-21 23:37:44,298 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:44,298 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] [2023-12-21 23:37:44,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-21 23:37:44,501 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-21 23:37:44,502 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:44,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:44,502 INFO L85 PathProgramCache]: Analyzing trace with hash -582127364, now seen corresponding path program 1 times [2023-12-21 23:37:44,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:44,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303098221] [2023-12-21 23:37:44,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:44,503 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-21 23:37:44,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:44,504 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-21 23:37:44,530 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-21 23:37:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:44,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 23:37:44,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:44,574 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-21 23:37:44,574 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:44,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:44,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303098221] [2023-12-21 23:37:44,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303098221] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:44,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:44,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 23:37:44,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059219477] [2023-12-21 23:37:44,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:44,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 23:37:44,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:44,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 23:37:44,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 23:37:44,576 INFO L87 Difference]: Start difference. First operand 922 states and 1691 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-21 23:37:44,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:44,614 INFO L93 Difference]: Finished difference Result 936 states and 1708 transitions. [2023-12-21 23:37:44,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 23:37:44,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 35 [2023-12-21 23:37:44,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:44,617 INFO L225 Difference]: With dead ends: 936 [2023-12-21 23:37:44,617 INFO L226 Difference]: Without dead ends: 934 [2023-12-21 23:37:44,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 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-21 23:37:44,618 INFO L413 NwaCegarLoop]: 1501 mSDtfsCounter, 1 mSDsluCounter, 2994 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4495 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:44,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4495 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:37:44,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2023-12-21 23:37:44,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 930. [2023-12-21 23:37:44,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 928 states have (on average 1.8297413793103448) internal successors, (1698), 929 states have internal predecessors, (1698), 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-21 23:37:44,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1698 transitions. [2023-12-21 23:37:44,630 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1698 transitions. Word has length 35 [2023-12-21 23:37:44,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:44,630 INFO L495 AbstractCegarLoop]: Abstraction has 930 states and 1698 transitions. [2023-12-21 23:37:44,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-21 23:37:44,630 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1698 transitions. [2023-12-21 23:37:44,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 23:37:44,631 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:44,631 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] [2023-12-21 23:37:44,636 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-21 23:37:44,833 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-21 23:37:44,834 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:44,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:44,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2127458807, now seen corresponding path program 1 times [2023-12-21 23:37:44,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:44,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951085696] [2023-12-21 23:37:44,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:44,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:37:44,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:44,836 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-21 23:37:44,861 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-21 23:37:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:44,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:44,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:44,973 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-21 23:37:44,973 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:44,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:44,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951085696] [2023-12-21 23:37:44,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951085696] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:44,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:44,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:37:44,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897461299] [2023-12-21 23:37:44,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:44,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:44,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:44,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:44,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:44,975 INFO L87 Difference]: Start difference. First operand 930 states and 1698 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-21 23:37:44,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:44,999 INFO L93 Difference]: Finished difference Result 1098 states and 1958 transitions. [2023-12-21 23:37:44,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:37:44,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2023-12-21 23:37:44,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:45,002 INFO L225 Difference]: With dead ends: 1098 [2023-12-21 23:37:45,002 INFO L226 Difference]: Without dead ends: 1009 [2023-12-21 23:37:45,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-21 23:37:45,003 INFO L413 NwaCegarLoop]: 1532 mSDtfsCounter, 1474 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1578 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-21 23:37:45,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1578 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:37:45,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2023-12-21 23:37:45,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1007. [2023-12-21 23:37:45,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1005 states have (on average 1.8049751243781094) internal successors, (1814), 1006 states have internal predecessors, (1814), 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-21 23:37:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1814 transitions. [2023-12-21 23:37:45,016 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1814 transitions. Word has length 36 [2023-12-21 23:37:45,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:45,017 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1814 transitions. [2023-12-21 23:37:45,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-21 23:37:45,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1814 transitions. [2023-12-21 23:37:45,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 23:37:45,017 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:45,017 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] [2023-12-21 23:37:45,035 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-21 23:37:45,220 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-21 23:37:45,221 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:45,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:45,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1501802743, now seen corresponding path program 1 times [2023-12-21 23:37:45,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:45,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595799094] [2023-12-21 23:37:45,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:45,222 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-21 23:37:45,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:45,223 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-21 23:37:45,224 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-21 23:37:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:45,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:45,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:45,344 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-21 23:37:45,345 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:45,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:45,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595799094] [2023-12-21 23:37:45,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595799094] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:45,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:45,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:37:45,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120659899] [2023-12-21 23:37:45,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:45,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:45,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:45,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:45,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:45,346 INFO L87 Difference]: Start difference. First operand 1007 states and 1814 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-21 23:37:45,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:45,378 INFO L93 Difference]: Finished difference Result 1433 states and 2457 transitions. [2023-12-21 23:37:45,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:37:45,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2023-12-21 23:37:45,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:45,383 INFO L225 Difference]: With dead ends: 1433 [2023-12-21 23:37:45,383 INFO L226 Difference]: Without dead ends: 1202 [2023-12-21 23:37:45,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-21 23:37:45,384 INFO L413 NwaCegarLoop]: 1534 mSDtfsCounter, 1472 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1584 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-21 23:37:45,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1584 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:37:45,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2023-12-21 23:37:45,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1200. [2023-12-21 23:37:45,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 1198 states have (on average 1.7479131886477461) internal successors, (2094), 1199 states have internal predecessors, (2094), 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-21 23:37:45,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 2094 transitions. [2023-12-21 23:37:45,402 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 2094 transitions. Word has length 36 [2023-12-21 23:37:45,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:45,402 INFO L495 AbstractCegarLoop]: Abstraction has 1200 states and 2094 transitions. [2023-12-21 23:37:45,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-21 23:37:45,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 2094 transitions. [2023-12-21 23:37:45,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 23:37:45,403 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:45,403 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] [2023-12-21 23:37:45,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-21 23:37:45,605 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-21 23:37:45,606 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:45,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:45,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1904431113, now seen corresponding path program 1 times [2023-12-21 23:37:45,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:45,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861973163] [2023-12-21 23:37:45,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:45,607 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-21 23:37:45,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:45,610 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-21 23:37:45,611 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-21 23:37:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:45,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:45,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:45,681 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-21 23:37:45,682 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:45,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:45,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861973163] [2023-12-21 23:37:45,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861973163] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:45,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:45,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:37:45,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737846193] [2023-12-21 23:37:45,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:45,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:45,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:45,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:45,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:45,683 INFO L87 Difference]: Start difference. First operand 1200 states and 2094 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-21 23:37:45,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:45,714 INFO L93 Difference]: Finished difference Result 1976 states and 3234 transitions. [2023-12-21 23:37:45,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:37:45,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2023-12-21 23:37:45,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:45,719 INFO L225 Difference]: With dead ends: 1976 [2023-12-21 23:37:45,719 INFO L226 Difference]: Without dead ends: 1552 [2023-12-21 23:37:45,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-21 23:37:45,720 INFO L413 NwaCegarLoop]: 1532 mSDtfsCounter, 1470 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1586 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-21 23:37:45,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1586 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:37:45,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2023-12-21 23:37:45,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1550. [2023-12-21 23:37:45,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1548 states have (on average 1.6679586563307494) internal successors, (2582), 1549 states have internal predecessors, (2582), 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-21 23:37:45,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2582 transitions. [2023-12-21 23:37:45,743 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2582 transitions. Word has length 36 [2023-12-21 23:37:45,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:45,743 INFO L495 AbstractCegarLoop]: Abstraction has 1550 states and 2582 transitions. [2023-12-21 23:37:45,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-21 23:37:45,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2582 transitions. [2023-12-21 23:37:45,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-21 23:37:45,744 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:45,744 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-21 23:37:45,754 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-21 23:37:45,946 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-21 23:37:45,947 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:45,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:45,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1853448570, now seen corresponding path program 1 times [2023-12-21 23:37:45,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:45,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579627532] [2023-12-21 23:37:45,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:45,948 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-21 23:37:45,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:45,949 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-21 23:37:45,963 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-21 23:37:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:46,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-21 23:37:46,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:46,507 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-21 23:37:46,507 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:37:46,806 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-21 23:37:46,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:46,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579627532] [2023-12-21 23:37:46,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579627532] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:37:46,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:37:46,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-21 23:37:46,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804230306] [2023-12-21 23:37:46,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:37:46,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 23:37:46,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:46,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 23:37:46,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-21 23:37:46,808 INFO L87 Difference]: Start difference. First operand 1550 states and 2582 transitions. Second operand has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 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-21 23:37:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:48,112 INFO L93 Difference]: Finished difference Result 3268 states and 5027 transitions. [2023-12-21 23:37:48,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 23:37:48,113 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 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 50 [2023-12-21 23:37:48,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:48,119 INFO L225 Difference]: With dead ends: 3268 [2023-12-21 23:37:48,119 INFO L226 Difference]: Without dead ends: 2714 [2023-12-21 23:37:48,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2023-12-21 23:37:48,121 INFO L413 NwaCegarLoop]: 1500 mSDtfsCounter, 3325 mSDsluCounter, 13527 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3325 SdHoareTripleChecker+Valid, 15027 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:48,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3325 Valid, 15027 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 23:37:48,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2023-12-21 23:37:48,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2322. [2023-12-21 23:37:48,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2322 states, 2320 states have (on average 1.5905172413793103) internal successors, (3690), 2321 states have internal predecessors, (3690), 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-21 23:37:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 3690 transitions. [2023-12-21 23:37:48,167 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 3690 transitions. Word has length 50 [2023-12-21 23:37:48,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:48,168 INFO L495 AbstractCegarLoop]: Abstraction has 2322 states and 3690 transitions. [2023-12-21 23:37:48,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 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-21 23:37:48,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 3690 transitions. [2023-12-21 23:37:48,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-21 23:37:48,168 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:48,168 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-21 23:37:48,171 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 (10)] Ended with exit code 0 [2023-12-21 23:37:48,371 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-21 23:37:48,372 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:48,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:48,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1815862662, now seen corresponding path program 1 times [2023-12-21 23:37:48,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:48,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528451365] [2023-12-21 23:37:48,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:48,373 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-21 23:37:48,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:48,374 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-21 23:37:48,404 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-21 23:37:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:48,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:48,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:48,457 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-21 23:37:48,458 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:48,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:48,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528451365] [2023-12-21 23:37:48,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528451365] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:48,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:48,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:37:48,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496740922] [2023-12-21 23:37:48,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:48,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:48,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:48,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:48,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:48,459 INFO L87 Difference]: Start difference. First operand 2322 states and 3690 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-21 23:37:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:48,515 INFO L93 Difference]: Finished difference Result 3444 states and 5327 transitions. [2023-12-21 23:37:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:37:48,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2023-12-21 23:37:48,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:48,520 INFO L225 Difference]: With dead ends: 3444 [2023-12-21 23:37:48,520 INFO L226 Difference]: Without dead ends: 1898 [2023-12-21 23:37:48,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-21 23:37:48,522 INFO L413 NwaCegarLoop]: 1526 mSDtfsCounter, 31 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3017 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-21 23:37:48,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3017 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:37:48,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2023-12-21 23:37:48,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1891. [2023-12-21 23:37:48,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1889 states have (on average 1.6236103758602436) internal successors, (3067), 1890 states have internal predecessors, (3067), 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-21 23:37:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 3067 transitions. [2023-12-21 23:37:48,556 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 3067 transitions. Word has length 50 [2023-12-21 23:37:48,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:48,556 INFO L495 AbstractCegarLoop]: Abstraction has 1891 states and 3067 transitions. [2023-12-21 23:37:48,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-21 23:37:48,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 3067 transitions. [2023-12-21 23:37:48,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-21 23:37:48,557 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:48,557 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] [2023-12-21 23:37:48,562 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-21 23:37:48,760 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-21 23:37:48,760 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:48,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:48,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1762784666, now seen corresponding path program 1 times [2023-12-21 23:37:48,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:48,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882174790] [2023-12-21 23:37:48,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:48,761 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-21 23:37:48,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:48,762 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-21 23:37:48,790 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-21 23:37:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:48,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:48,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:48,839 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-21 23:37:48,840 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:48,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:48,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882174790] [2023-12-21 23:37:48,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1882174790] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:48,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:48,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:37:48,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350095327] [2023-12-21 23:37:48,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:48,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:48,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:48,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:48,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:48,841 INFO L87 Difference]: Start difference. First operand 1891 states and 3067 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-21 23:37:48,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:48,872 INFO L93 Difference]: Finished difference Result 2447 states and 3867 transitions. [2023-12-21 23:37:48,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:37:48,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2023-12-21 23:37:48,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:48,876 INFO L225 Difference]: With dead ends: 2447 [2023-12-21 23:37:48,876 INFO L226 Difference]: Without dead ends: 1341 [2023-12-21 23:37:48,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-21 23:37:48,877 INFO L413 NwaCegarLoop]: 1519 mSDtfsCounter, 27 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3002 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-21 23:37:48,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3002 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:37:48,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2023-12-21 23:37:48,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1339. [2023-12-21 23:37:48,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 1337 states have (on average 1.68810770381451) internal successors, (2257), 1338 states have internal predecessors, (2257), 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-21 23:37:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2257 transitions. [2023-12-21 23:37:48,899 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2257 transitions. Word has length 52 [2023-12-21 23:37:48,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:48,900 INFO L495 AbstractCegarLoop]: Abstraction has 1339 states and 2257 transitions. [2023-12-21 23:37:48,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-21 23:37:48,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2257 transitions. [2023-12-21 23:37:48,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-21 23:37:48,900 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:48,900 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] [2023-12-21 23:37:48,905 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-21 23:37:49,103 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-21 23:37:49,104 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:49,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:49,104 INFO L85 PathProgramCache]: Analyzing trace with hash 857932558, now seen corresponding path program 1 times [2023-12-21 23:37:49,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:49,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116844116] [2023-12-21 23:37:49,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:49,104 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-21 23:37:49,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:49,105 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-21 23:37:49,111 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-21 23:37:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:49,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-21 23:37:49,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:49,730 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-21 23:37:49,730 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:37:49,956 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-21 23:37:49,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:49,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116844116] [2023-12-21 23:37:49,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116844116] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:37:49,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:37:49,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-21 23:37:49,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602231409] [2023-12-21 23:37:49,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:37:49,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 23:37:49,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:49,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 23:37:49,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-21 23:37:49,957 INFO L87 Difference]: Start difference. First operand 1339 states and 2257 transitions. Second operand has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 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-21 23:37:50,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:50,620 INFO L93 Difference]: Finished difference Result 1933 states and 3088 transitions. [2023-12-21 23:37:50,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 23:37:50,621 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 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 53 [2023-12-21 23:37:50,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:50,624 INFO L225 Difference]: With dead ends: 1933 [2023-12-21 23:37:50,624 INFO L226 Difference]: Without dead ends: 1379 [2023-12-21 23:37:50,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2023-12-21 23:37:50,626 INFO L413 NwaCegarLoop]: 1474 mSDtfsCounter, 4481 mSDsluCounter, 11786 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4481 SdHoareTripleChecker+Valid, 13260 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:50,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4481 Valid, 13260 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 23:37:50,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2023-12-21 23:37:50,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1353. [2023-12-21 23:37:50,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1351 states have (on average 1.682457438934123) internal successors, (2273), 1352 states have internal predecessors, (2273), 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-21 23:37:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2273 transitions. [2023-12-21 23:37:50,651 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 2273 transitions. Word has length 53 [2023-12-21 23:37:50,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:50,651 INFO L495 AbstractCegarLoop]: Abstraction has 1353 states and 2273 transitions. [2023-12-21 23:37:50,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 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-21 23:37:50,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 2273 transitions. [2023-12-21 23:37:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-21 23:37:50,652 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:50,652 INFO L195 NwaCegarLoop]: trace histogram [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-21 23:37:50,669 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-21 23:37:50,855 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-21 23:37:50,855 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:50,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:50,856 INFO L85 PathProgramCache]: Analyzing trace with hash -443153606, now seen corresponding path program 1 times [2023-12-21 23:37:50,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:50,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902196588] [2023-12-21 23:37:50,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:50,856 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-21 23:37:50,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:50,864 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-21 23:37:50,865 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-21 23:37:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:50,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:50,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:50,940 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-21 23:37:50,941 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:50,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:50,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902196588] [2023-12-21 23:37:50,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902196588] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:50,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:50,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:37:50,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509337212] [2023-12-21 23:37:50,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:50,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:50,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:50,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:50,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:50,943 INFO L87 Difference]: Start difference. First operand 1353 states and 2273 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-21 23:37:50,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:50,967 INFO L93 Difference]: Finished difference Result 1633 states and 2665 transitions. [2023-12-21 23:37:50,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:37:50,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 55 [2023-12-21 23:37:50,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:50,971 INFO L225 Difference]: With dead ends: 1633 [2023-12-21 23:37:50,971 INFO L226 Difference]: Without dead ends: 1079 [2023-12-21 23:37:50,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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-21 23:37:50,972 INFO L413 NwaCegarLoop]: 1512 mSDtfsCounter, 23 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2987 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-21 23:37:50,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2987 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:37:50,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2023-12-21 23:37:50,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1077. [2023-12-21 23:37:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1075 states have (on average 1.7404651162790699) internal successors, (1871), 1076 states have internal predecessors, (1871), 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-21 23:37:50,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1871 transitions. [2023-12-21 23:37:50,994 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1871 transitions. Word has length 55 [2023-12-21 23:37:50,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:50,995 INFO L495 AbstractCegarLoop]: Abstraction has 1077 states and 1871 transitions. [2023-12-21 23:37:50,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-21 23:37:50,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1871 transitions. [2023-12-21 23:37:50,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-21 23:37:50,995 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:50,995 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] [2023-12-21 23:37:51,015 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-21 23:37:51,198 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-21 23:37:51,199 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:51,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:51,199 INFO L85 PathProgramCache]: Analyzing trace with hash -294444102, now seen corresponding path program 1 times [2023-12-21 23:37:51,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:51,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099291022] [2023-12-21 23:37:51,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:51,200 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-21 23:37:51,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:51,202 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-21 23:37:51,223 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-21 23:37:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:51,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-21 23:37:51,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:51,853 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-21 23:37:51,853 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:37:52,084 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-21 23:37:52,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:52,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099291022] [2023-12-21 23:37:52,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099291022] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:37:52,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:37:52,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-21 23:37:52,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213030185] [2023-12-21 23:37:52,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:37:52,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 23:37:52,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:52,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 23:37:52,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-21 23:37:52,085 INFO L87 Difference]: Start difference. First operand 1077 states and 1871 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-21 23:37:52,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:52,958 INFO L93 Difference]: Finished difference Result 1627 states and 2614 transitions. [2023-12-21 23:37:52,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-21 23:37:52,959 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 56 [2023-12-21 23:37:52,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:52,962 INFO L225 Difference]: With dead ends: 1627 [2023-12-21 23:37:52,963 INFO L226 Difference]: Without dead ends: 1349 [2023-12-21 23:37:52,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2023-12-21 23:37:52,964 INFO L413 NwaCegarLoop]: 1509 mSDtfsCounter, 6215 mSDsluCounter, 10471 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6215 SdHoareTripleChecker+Valid, 11980 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:52,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6215 Valid, 11980 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 23:37:52,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2023-12-21 23:37:52,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1285. [2023-12-21 23:37:52,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1283 states have (on average 1.6703039750584567) internal successors, (2143), 1284 states have internal predecessors, (2143), 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-21 23:37:52,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 2143 transitions. [2023-12-21 23:37:52,987 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 2143 transitions. Word has length 56 [2023-12-21 23:37:52,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:52,987 INFO L495 AbstractCegarLoop]: Abstraction has 1285 states and 2143 transitions. [2023-12-21 23:37:52,987 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-21 23:37:52,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 2143 transitions. [2023-12-21 23:37:52,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-21 23:37:52,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:52,987 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-21 23:37:53,002 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-21 23:37:53,191 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-21 23:37:53,191 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:53,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:53,191 INFO L85 PathProgramCache]: Analyzing trace with hash -402890190, now seen corresponding path program 1 times [2023-12-21 23:37:53,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:53,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016136620] [2023-12-21 23:37:53,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:53,192 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-21 23:37:53,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:53,193 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-21 23:37:53,229 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-21 23:37:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:53,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 23:37:53,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 23:37:53,315 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:37:53,394 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 23:37:53,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:53,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016136620] [2023-12-21 23:37:53,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1016136620] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:37:53,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:37:53,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-21 23:37:53,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887900904] [2023-12-21 23:37:53,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:37:53,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 23:37:53,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:53,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 23:37:53,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 23:37:53,396 INFO L87 Difference]: Start difference. First operand 1285 states and 2143 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:37:53,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:53,465 INFO L93 Difference]: Finished difference Result 2233 states and 3384 transitions. [2023-12-21 23:37:53,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:37:53,466 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-12-21 23:37:53,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:53,470 INFO L225 Difference]: With dead ends: 2233 [2023-12-21 23:37:53,471 INFO L226 Difference]: Without dead ends: 1747 [2023-12-21 23:37:53,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 110 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-21 23:37:53,472 INFO L413 NwaCegarLoop]: 1510 mSDtfsCounter, 1486 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 3094 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:53,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 3094 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:37:53,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2023-12-21 23:37:53,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1691. [2023-12-21 23:37:53,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1689 states have (on average 1.5476613380698638) internal successors, (2614), 1690 states have internal predecessors, (2614), 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-21 23:37:53,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2614 transitions. [2023-12-21 23:37:53,505 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2614 transitions. Word has length 58 [2023-12-21 23:37:53,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:53,505 INFO L495 AbstractCegarLoop]: Abstraction has 1691 states and 2614 transitions. [2023-12-21 23:37:53,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:37:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2614 transitions. [2023-12-21 23:37:53,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-21 23:37:53,505 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:53,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:37:53,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-21 23:37:53,708 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-21 23:37:53,709 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:53,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:53,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1349660345, now seen corresponding path program 1 times [2023-12-21 23:37:53,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:53,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061757095] [2023-12-21 23:37:53,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:53,710 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-21 23:37:53,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:53,711 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-21 23:37:53,726 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-21 23:37:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:53,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:53,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:53,878 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-21 23:37:53,879 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:53,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:53,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061757095] [2023-12-21 23:37:53,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061757095] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:53,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:53,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 23:37:53,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457723998] [2023-12-21 23:37:53,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:53,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:53,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:53,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:53,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:53,880 INFO L87 Difference]: Start difference. First operand 1691 states and 2614 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 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-21 23:38:25,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:25,341 INFO L93 Difference]: Finished difference Result 3195 states and 5487 transitions. [2023-12-21 23:38:25,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:38:25,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 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-21 23:38:25,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:25,348 INFO L225 Difference]: With dead ends: 3195 [2023-12-21 23:38:25,348 INFO L226 Difference]: Without dead ends: 2442 [2023-12-21 23:38:25,350 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-21 23:38:25,350 INFO L413 NwaCegarLoop]: 531 mSDtfsCounter, 807 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2406 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 2862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 2406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.3s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:25,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 538 Invalid, 2862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 2406 Invalid, 0 Unknown, 0 Unchecked, 31.3s Time] [2023-12-21 23:38:25,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2023-12-21 23:38:25,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2442. [2023-12-21 23:38:25,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 2440 states have (on average 1.4725409836065573) internal successors, (3593), 2441 states have internal predecessors, (3593), 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-21 23:38:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3593 transitions. [2023-12-21 23:38:25,393 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3593 transitions. Word has length 60 [2023-12-21 23:38:25,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:25,393 INFO L495 AbstractCegarLoop]: Abstraction has 2442 states and 3593 transitions. [2023-12-21 23:38:25,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 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-21 23:38:25,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3593 transitions. [2023-12-21 23:38:25,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-21 23:38:25,394 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:25,394 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2023-12-21 23:38:25,397 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 (17)] Ended with exit code 0 [2023-12-21 23:38:25,597 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-21 23:38:25,597 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:25,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:25,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1592884220, now seen corresponding path program 1 times [2023-12-21 23:38:25,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:25,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934110177] [2023-12-21 23:38:25,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:25,598 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-21 23:38:25,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:25,599 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-21 23:38:25,601 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-21 23:38:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:25,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-21 23:38:25,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 30 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:26,625 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:27,065 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 30 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:27,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:27,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934110177] [2023-12-21 23:38:27,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934110177] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:27,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:27,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-21 23:38:27,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363133502] [2023-12-21 23:38:27,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:27,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:38:27,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:27,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:38:27,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:38:27,067 INFO L87 Difference]: Start difference. First operand 2442 states and 3593 transitions. Second operand has 26 states, 26 states have (on average 6.384615384615385) internal successors, (166), 25 states have internal predecessors, (166), 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-21 23:38:28,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:28,372 INFO L93 Difference]: Finished difference Result 3030 states and 4348 transitions. [2023-12-21 23:38:28,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-21 23:38:28,372 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.384615384615385) internal successors, (166), 25 states have internal predecessors, (166), 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 91 [2023-12-21 23:38:28,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:28,379 INFO L225 Difference]: With dead ends: 3030 [2023-12-21 23:38:28,379 INFO L226 Difference]: Without dead ends: 2466 [2023-12-21 23:38:28,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=383, Invalid=1423, Unknown=0, NotChecked=0, Total=1806 [2023-12-21 23:38:28,380 INFO L413 NwaCegarLoop]: 1493 mSDtfsCounter, 16448 mSDsluCounter, 6141 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16448 SdHoareTripleChecker+Valid, 7634 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:28,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16448 Valid, 7634 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 23:38:28,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2023-12-21 23:38:28,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 2442. [2023-12-21 23:38:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 2440 states have (on average 1.4655737704918033) internal successors, (3576), 2441 states have internal predecessors, (3576), 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-21 23:38:28,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3576 transitions. [2023-12-21 23:38:28,423 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3576 transitions. Word has length 91 [2023-12-21 23:38:28,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:28,423 INFO L495 AbstractCegarLoop]: Abstraction has 2442 states and 3576 transitions. [2023-12-21 23:38:28,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.384615384615385) internal successors, (166), 25 states have internal predecessors, (166), 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-21 23:38:28,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3576 transitions. [2023-12-21 23:38:28,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-21 23:38:28,424 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:28,424 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:38:28,427 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-21 23:38:28,627 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-21 23:38:28,627 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:28,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:28,628 INFO L85 PathProgramCache]: Analyzing trace with hash -354529050, now seen corresponding path program 1 times [2023-12-21 23:38:28,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:28,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085653677] [2023-12-21 23:38:28,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:28,628 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-21 23:38:28,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:28,630 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-21 23:38:28,630 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-21 23:38:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:28,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-21 23:38:28,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 22 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:29,583 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 22 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:30,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:30,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085653677] [2023-12-21 23:38:30,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085653677] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:30,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:30,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-21 23:38:30,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688974332] [2023-12-21 23:38:30,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:30,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:38:30,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:30,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:38:30,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:38:30,032 INFO L87 Difference]: Start difference. First operand 2442 states and 3576 transitions. Second operand has 26 states, 26 states have (on average 6.615384615384615) internal successors, (172), 25 states have internal predecessors, (172), 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-21 23:38:31,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:31,398 INFO L93 Difference]: Finished difference Result 3138 states and 4456 transitions. [2023-12-21 23:38:31,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-21 23:38:31,399 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.615384615384615) internal successors, (172), 25 states have internal predecessors, (172), 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 92 [2023-12-21 23:38:31,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:31,402 INFO L225 Difference]: With dead ends: 3138 [2023-12-21 23:38:31,402 INFO L226 Difference]: Without dead ends: 2444 [2023-12-21 23:38:31,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=403, Invalid=1489, Unknown=0, NotChecked=0, Total=1892 [2023-12-21 23:38:31,404 INFO L413 NwaCegarLoop]: 1493 mSDtfsCounter, 16214 mSDsluCounter, 7566 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16214 SdHoareTripleChecker+Valid, 9059 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:31,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16214 Valid, 9059 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 23:38:31,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2023-12-21 23:38:31,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 2442. [2023-12-21 23:38:31,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 2440 states have (on average 1.459016393442623) internal successors, (3560), 2441 states have internal predecessors, (3560), 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-21 23:38:31,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3560 transitions. [2023-12-21 23:38:31,502 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3560 transitions. Word has length 92 [2023-12-21 23:38:31,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:31,503 INFO L495 AbstractCegarLoop]: Abstraction has 2442 states and 3560 transitions. [2023-12-21 23:38:31,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.615384615384615) internal successors, (172), 25 states have internal predecessors, (172), 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-21 23:38:31,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3560 transitions. [2023-12-21 23:38:31,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-21 23:38:31,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:31,503 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-21 23:38:31,522 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-21 23:38:31,708 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-21 23:38:31,708 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:31,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:31,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1749922772, now seen corresponding path program 1 times [2023-12-21 23:38:31,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:31,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106486593] [2023-12-21 23:38:31,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:31,709 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-21 23:38:31,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:31,710 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-21 23:38:31,714 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-21 23:38:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:31,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 23:38:31,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:32,891 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:33,403 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:33,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:33,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106486593] [2023-12-21 23:38:33,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106486593] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:33,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:33,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-21 23:38:33,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553492287] [2023-12-21 23:38:33,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:33,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:38:33,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:33,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:38:33,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:38:33,405 INFO L87 Difference]: Start difference. First operand 2442 states and 3560 transitions. Second operand has 26 states, 26 states have (on average 6.923076923076923) internal successors, (180), 26 states have internal predecessors, (180), 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-21 23:38:35,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:35,688 INFO L93 Difference]: Finished difference Result 3202 states and 4507 transitions. [2023-12-21 23:38:35,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-21 23:38:35,689 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.923076923076923) internal successors, (180), 26 states have internal predecessors, (180), 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 93 [2023-12-21 23:38:35,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:35,694 INFO L225 Difference]: With dead ends: 3202 [2023-12-21 23:38:35,694 INFO L226 Difference]: Without dead ends: 2824 [2023-12-21 23:38:35,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=306, Invalid=1950, Unknown=0, NotChecked=0, Total=2256 [2023-12-21 23:38:35,696 INFO L413 NwaCegarLoop]: 1518 mSDtfsCounter, 3251 mSDsluCounter, 24085 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3251 SdHoareTripleChecker+Valid, 25603 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:35,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3251 Valid, 25603 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-21 23:38:35,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2023-12-21 23:38:35,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 2326. [2023-12-21 23:38:35,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2326 states, 2324 states have (on average 1.4728915662650603) internal successors, (3423), 2325 states have internal predecessors, (3423), 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-21 23:38:35,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 3423 transitions. [2023-12-21 23:38:35,745 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 3423 transitions. Word has length 93 [2023-12-21 23:38:35,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:35,745 INFO L495 AbstractCegarLoop]: Abstraction has 2326 states and 3423 transitions. [2023-12-21 23:38:35,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.923076923076923) internal successors, (180), 26 states have internal predecessors, (180), 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-21 23:38:35,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 3423 transitions. [2023-12-21 23:38:35,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-21 23:38:35,745 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:35,746 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-21 23:38:35,749 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 (20)] Ended with exit code 0 [2023-12-21 23:38:35,948 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-21 23:38:35,949 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:35,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:35,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2104628344, now seen corresponding path program 1 times [2023-12-21 23:38:35,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:35,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174401079] [2023-12-21 23:38:35,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:35,950 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-21 23:38:35,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:35,951 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-21 23:38:35,951 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-21 23:38:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:36,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 23:38:36,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:36,990 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:36,990 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:37,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:37,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174401079] [2023-12-21 23:38:37,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174401079] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:37,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:37,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-21 23:38:37,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246184604] [2023-12-21 23:38:37,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:37,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:38:37,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:37,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:38:37,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:38:37,450 INFO L87 Difference]: Start difference. First operand 2326 states and 3423 transitions. Second operand has 26 states, 26 states have (on average 6.730769230769231) internal successors, (175), 26 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-21 23:38:42,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:42,765 INFO L93 Difference]: Finished difference Result 2976 states and 4222 transitions. [2023-12-21 23:38:42,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-21 23:38:42,766 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.730769230769231) internal successors, (175), 26 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 93 [2023-12-21 23:38:42,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:42,773 INFO L225 Difference]: With dead ends: 2976 [2023-12-21 23:38:42,773 INFO L226 Difference]: Without dead ends: 2694 [2023-12-21 23:38:42,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=863, Invalid=3967, Unknown=0, NotChecked=0, Total=4830 [2023-12-21 23:38:42,775 INFO L413 NwaCegarLoop]: 1578 mSDtfsCounter, 1847 mSDsluCounter, 26239 mSDsCounter, 0 mSdLazyCounter, 2017 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1847 SdHoareTripleChecker+Valid, 27817 SdHoareTripleChecker+Invalid, 2034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:42,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1847 Valid, 27817 Invalid, 2034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2017 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-21 23:38:42,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2023-12-21 23:38:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2494. [2023-12-21 23:38:42,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2494 states, 2492 states have (on average 1.4526484751203852) internal successors, (3620), 2493 states have internal predecessors, (3620), 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-21 23:38:42,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2494 states and 3620 transitions. [2023-12-21 23:38:42,831 INFO L78 Accepts]: Start accepts. Automaton has 2494 states and 3620 transitions. Word has length 93 [2023-12-21 23:38:42,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:42,831 INFO L495 AbstractCegarLoop]: Abstraction has 2494 states and 3620 transitions. [2023-12-21 23:38:42,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.730769230769231) internal successors, (175), 26 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-21 23:38:42,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 3620 transitions. [2023-12-21 23:38:42,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-21 23:38:42,837 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:42,837 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-21 23:38:42,840 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 (21)] Forceful destruction successful, exit code 0 [2023-12-21 23:38:43,040 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-21 23:38:43,040 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:43,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:43,041 INFO L85 PathProgramCache]: Analyzing trace with hash -404456876, now seen corresponding path program 1 times [2023-12-21 23:38:43,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:43,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036082884] [2023-12-21 23:38:43,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:43,041 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-21 23:38:43,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:43,042 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-21 23:38:43,043 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-21 23:38:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:43,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 23:38:43,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:44,063 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:44,063 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:44,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:44,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036082884] [2023-12-21 23:38:44,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036082884] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:44,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:44,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-21 23:38:44,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189387095] [2023-12-21 23:38:44,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:44,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:38:44,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:44,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:38:44,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:38:44,550 INFO L87 Difference]: Start difference. First operand 2494 states and 3620 transitions. Second operand has 26 states, 26 states have (on average 6.538461538461538) internal successors, (170), 26 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:50,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:50,346 INFO L93 Difference]: Finished difference Result 4138 states and 5597 transitions. [2023-12-21 23:38:50,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-12-21 23:38:50,346 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.538461538461538) internal successors, (170), 26 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2023-12-21 23:38:50,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:50,352 INFO L225 Difference]: With dead ends: 4138 [2023-12-21 23:38:50,352 INFO L226 Difference]: Without dead ends: 3838 [2023-12-21 23:38:50,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1011, Invalid=4995, Unknown=0, NotChecked=0, Total=6006 [2023-12-21 23:38:50,354 INFO L413 NwaCegarLoop]: 1594 mSDtfsCounter, 3338 mSDsluCounter, 27906 mSDsCounter, 0 mSdLazyCounter, 2314 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3338 SdHoareTripleChecker+Valid, 29500 SdHoareTripleChecker+Invalid, 2332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:50,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3338 Valid, 29500 Invalid, 2332 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [18 Valid, 2314 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-21 23:38:50,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3838 states. [2023-12-21 23:38:50,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3838 to 3197. [2023-12-21 23:38:50,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3197 states, 3195 states have (on average 1.396244131455399) internal successors, (4461), 3196 states have internal predecessors, (4461), 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-21 23:38:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3197 states to 3197 states and 4461 transitions. [2023-12-21 23:38:50,465 INFO L78 Accepts]: Start accepts. Automaton has 3197 states and 4461 transitions. Word has length 93 [2023-12-21 23:38:50,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:50,480 INFO L495 AbstractCegarLoop]: Abstraction has 3197 states and 4461 transitions. [2023-12-21 23:38:50,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.538461538461538) internal successors, (170), 26 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:50,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3197 states and 4461 transitions. [2023-12-21 23:38:50,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-21 23:38:50,482 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:50,482 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-21 23:38:50,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-12-21 23:38:50,685 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-21 23:38:50,686 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:50,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:50,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1660613195, now seen corresponding path program 1 times [2023-12-21 23:38:50,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:50,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631585562] [2023-12-21 23:38:50,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:50,687 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-21 23:38:50,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:50,688 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-21 23:38:50,714 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-21 23:38:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:50,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:38:50,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:50,830 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:50,830 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:50,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:50,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631585562] [2023-12-21 23:38:50,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631585562] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:50,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:50,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 23:38:50,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714663849] [2023-12-21 23:38:50,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:50,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:38:50,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:50,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:38:50,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:38:50,832 INFO L87 Difference]: Start difference. First operand 3197 states and 4461 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 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-21 23:39:25,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:39:25,336 INFO L93 Difference]: Finished difference Result 6205 states and 9293 transitions. [2023-12-21 23:39:25,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:39:25,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 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 128 [2023-12-21 23:39:25,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:39:25,344 INFO L225 Difference]: With dead ends: 6205 [2023-12-21 23:39:25,344 INFO L226 Difference]: Without dead ends: 4701 [2023-12-21 23:39:25,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 126 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-21 23:39:25,347 INFO L413 NwaCegarLoop]: 406 mSDtfsCounter, 986 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2527 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 2862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 2527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.3s IncrementalHoareTripleChecker+Time [2023-12-21 23:39:25,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 413 Invalid, 2862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 2527 Invalid, 0 Unknown, 0 Unchecked, 34.3s Time] [2023-12-21 23:39:25,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4701 states. [2023-12-21 23:39:25,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4701 to 4699. [2023-12-21 23:39:25,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4699 states, 4697 states have (on average 1.3693847136470088) internal successors, (6432), 4698 states have internal predecessors, (6432), 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-21 23:39:25,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4699 states to 4699 states and 6432 transitions. [2023-12-21 23:39:25,488 INFO L78 Accepts]: Start accepts. Automaton has 4699 states and 6432 transitions. Word has length 128 [2023-12-21 23:39:25,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:39:25,488 INFO L495 AbstractCegarLoop]: Abstraction has 4699 states and 6432 transitions. [2023-12-21 23:39:25,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 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-21 23:39:25,488 INFO L276 IsEmpty]: Start isEmpty. Operand 4699 states and 6432 transitions. [2023-12-21 23:39:25,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 23:39:25,490 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:39:25,490 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-21 23:39:25,496 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 (23)] Ended with exit code 0 [2023-12-21 23:39:25,693 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-21 23:39:25,694 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:39:25,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:39:25,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1227951098, now seen corresponding path program 2 times [2023-12-21 23:39:25,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:39:25,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160845706] [2023-12-21 23:39:25,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 23:39:25,694 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-21 23:39:25,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:39:25,696 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-21 23:39:25,697 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-21 23:39:25,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 23:39:25,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 23:39:25,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:39:25,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:39:26,191 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2023-12-21 23:39:26,192 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:39:26,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:39:26,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160845706] [2023-12-21 23:39:26,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160845706] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:39:26,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:39:26,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 23:39:26,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138217314] [2023-12-21 23:39:26,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:39:26,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 23:39:26,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:39:26,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 23:39:26,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:39:26,193 INFO L87 Difference]: Start difference. First operand 4699 states and 6432 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-21 23:39:26,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:39:26,345 INFO L93 Difference]: Finished difference Result 5481 states and 7421 transitions. [2023-12-21 23:39:26,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:39:26,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 130 [2023-12-21 23:39:26,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:39:26,376 INFO L225 Difference]: With dead ends: 5481 [2023-12-21 23:39:26,376 INFO L226 Difference]: Without dead ends: 4827 [2023-12-21 23:39:26,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 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-21 23:39:26,378 INFO L413 NwaCegarLoop]: 1531 mSDtfsCounter, 2972 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2972 SdHoareTripleChecker+Valid, 3093 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:39:26,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2972 Valid, 3093 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 23:39:26,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2023-12-21 23:39:26,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 4691. [2023-12-21 23:39:26,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4691 states, 4689 states have (on average 1.363190445724035) internal successors, (6392), 4690 states have internal predecessors, (6392), 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-21 23:39:26,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4691 states to 4691 states and 6392 transitions. [2023-12-21 23:39:26,535 INFO L78 Accepts]: Start accepts. Automaton has 4691 states and 6392 transitions. Word has length 130 [2023-12-21 23:39:26,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:39:26,535 INFO L495 AbstractCegarLoop]: Abstraction has 4691 states and 6392 transitions. [2023-12-21 23:39:26,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-21 23:39:26,535 INFO L276 IsEmpty]: Start isEmpty. Operand 4691 states and 6392 transitions. [2023-12-21 23:39:26,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 23:39:26,537 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:39:26,537 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-21 23:39:26,542 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 (24)] Ended with exit code 0 [2023-12-21 23:39:26,739 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-21 23:39:26,740 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:39:26,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:39:26,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1582656670, now seen corresponding path program 2 times [2023-12-21 23:39:26,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:39:26,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462589175] [2023-12-21 23:39:26,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 23:39:26,741 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-21 23:39:26,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:39:26,742 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-21 23:39:26,742 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-21 23:39:26,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 23:39:26,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 23:39:26,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:39:26,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:39:27,159 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2023-12-21 23:39:27,160 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:39:27,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:39:27,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462589175] [2023-12-21 23:39:27,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462589175] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:39:27,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:39:27,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 23:39:27,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054426843] [2023-12-21 23:39:27,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:39:27,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 23:39:27,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:39:27,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 23:39:27,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:39:27,163 INFO L87 Difference]: Start difference. First operand 4691 states and 6392 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-21 23:39:27,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:39:27,303 INFO L93 Difference]: Finished difference Result 5260 states and 7128 transitions. [2023-12-21 23:39:27,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:39:27,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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 130 [2023-12-21 23:39:27,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:39:27,309 INFO L225 Difference]: With dead ends: 5260 [2023-12-21 23:39:27,309 INFO L226 Difference]: Without dead ends: 4931 [2023-12-21 23:39:27,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 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-21 23:39:27,310 INFO L413 NwaCegarLoop]: 1534 mSDtfsCounter, 1523 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 3120 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:39:27,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 3120 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 23:39:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4931 states. [2023-12-21 23:39:27,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4931 to 4863. [2023-12-21 23:39:27,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4863 states, 4861 states have (on average 1.3542480970993622) internal successors, (6583), 4862 states have internal predecessors, (6583), 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-21 23:39:27,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4863 states to 4863 states and 6583 transitions. [2023-12-21 23:39:27,435 INFO L78 Accepts]: Start accepts. Automaton has 4863 states and 6583 transitions. Word has length 130 [2023-12-21 23:39:27,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:39:27,435 INFO L495 AbstractCegarLoop]: Abstraction has 4863 states and 6583 transitions. [2023-12-21 23:39:27,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-21 23:39:27,435 INFO L276 IsEmpty]: Start isEmpty. Operand 4863 states and 6583 transitions. [2023-12-21 23:39:27,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 23:39:27,437 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:39:27,437 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-21 23:39:27,458 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-21 23:39:27,639 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-21 23:39:27,640 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:39:27,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:39:27,640 INFO L85 PathProgramCache]: Analyzing trace with hash -926428550, now seen corresponding path program 2 times [2023-12-21 23:39:27,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:39:27,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469431270] [2023-12-21 23:39:27,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 23:39:27,641 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-21 23:39:27,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:39:27,642 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-21 23:39:27,643 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-21 23:39:27,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 23:39:27,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 23:39:27,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:39:27,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:39:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2023-12-21 23:39:28,135 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:39:28,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:39:28,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469431270] [2023-12-21 23:39:28,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469431270] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:39:28,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:39:28,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 23:39:28,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451026041] [2023-12-21 23:39:28,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:39:28,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 23:39:28,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:39:28,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 23:39:28,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:39:28,136 INFO L87 Difference]: Start difference. First operand 4863 states and 6583 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-21 23:39:28,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:39:28,306 INFO L93 Difference]: Finished difference Result 5387 states and 7259 transitions. [2023-12-21 23:39:28,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:39:28,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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 130 [2023-12-21 23:39:28,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:39:28,311 INFO L225 Difference]: With dead ends: 5387 [2023-12-21 23:39:28,311 INFO L226 Difference]: Without dead ends: 5113 [2023-12-21 23:39:28,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 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-21 23:39:28,313 INFO L413 NwaCegarLoop]: 1534 mSDtfsCounter, 2964 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2964 SdHoareTripleChecker+Valid, 3090 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:39:28,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2964 Valid, 3090 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 23:39:28,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5113 states. [2023-12-21 23:39:28,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5113 to 5045. [2023-12-21 23:39:28,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5045 states, 5043 states have (on average 1.347015665278604) internal successors, (6793), 5044 states have internal predecessors, (6793), 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-21 23:39:28,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5045 states to 5045 states and 6793 transitions. [2023-12-21 23:39:28,423 INFO L78 Accepts]: Start accepts. Automaton has 5045 states and 6793 transitions. Word has length 130 [2023-12-21 23:39:28,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:39:28,424 INFO L495 AbstractCegarLoop]: Abstraction has 5045 states and 6793 transitions. [2023-12-21 23:39:28,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-21 23:39:28,424 INFO L276 IsEmpty]: Start isEmpty. Operand 5045 states and 6793 transitions. [2023-12-21 23:39:28,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-21 23:39:28,426 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:39:28,426 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:39:28,429 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 (26)] Ended with exit code 0 [2023-12-21 23:39:28,628 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-21 23:39:28,628 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:39:28,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:39:28,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1193260010, now seen corresponding path program 1 times [2023-12-21 23:39:28,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:39:28,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861414403] [2023-12-21 23:39:28,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:39:28,629 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-21 23:39:28,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:39:28,630 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-21 23:39:28,633 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-21 23:39:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:39:28,747 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 23:39:28,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:39:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 54 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:39:29,843 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:39:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 54 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:39:30,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:39:30,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861414403] [2023-12-21 23:39:30,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861414403] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:39:30,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:39:30,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-21 23:39:30,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899424083] [2023-12-21 23:39:30,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:39:30,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 23:39:30,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:39:30,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 23:39:30,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1006, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 23:39:30,694 INFO L87 Difference]: Start difference. First operand 5045 states and 6793 transitions. Second operand has 34 states, 34 states have (on average 7.176470588235294) internal successors, (244), 34 states have internal predecessors, (244), 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-21 23:40:01,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:40:01,466 INFO L93 Difference]: Finished difference Result 14572 states and 18267 transitions. [2023-12-21 23:40:01,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 262 states. [2023-12-21 23:40:01,467 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 7.176470588235294) internal successors, (244), 34 states have internal predecessors, (244), 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 131 [2023-12-21 23:40:01,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:40:01,479 INFO L225 Difference]: With dead ends: 14572 [2023-12-21 23:40:01,479 INFO L226 Difference]: Without dead ends: 13980 [2023-12-21 23:40:01,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33525 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=8390, Invalid=76000, Unknown=0, NotChecked=0, Total=84390 [2023-12-21 23:40:01,489 INFO L413 NwaCegarLoop]: 1680 mSDtfsCounter, 26166 mSDsluCounter, 11911 mSDsCounter, 0 mSdLazyCounter, 3451 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26166 SdHoareTripleChecker+Valid, 13591 SdHoareTripleChecker+Invalid, 3543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 3451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-12-21 23:40:01,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26166 Valid, 13591 Invalid, 3543 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [92 Valid, 3451 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-12-21 23:40:01,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13980 states. [2023-12-21 23:40:01,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13980 to 13176. [2023-12-21 23:40:01,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13176 states, 13174 states have (on average 1.253377865492637) internal successors, (16512), 13175 states have internal predecessors, (16512), 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-21 23:40:02,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13176 states to 13176 states and 16512 transitions. [2023-12-21 23:40:02,000 INFO L78 Accepts]: Start accepts. Automaton has 13176 states and 16512 transitions. Word has length 131 [2023-12-21 23:40:02,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:40:02,001 INFO L495 AbstractCegarLoop]: Abstraction has 13176 states and 16512 transitions. [2023-12-21 23:40:02,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.176470588235294) internal successors, (244), 34 states have internal predecessors, (244), 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-21 23:40:02,001 INFO L276 IsEmpty]: Start isEmpty. Operand 13176 states and 16512 transitions. [2023-12-21 23:40:02,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-21 23:40:02,005 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:40:02,006 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:40:02,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 (27)] Forceful destruction successful, exit code 0 [2023-12-21 23:40:02,210 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-21 23:40:02,210 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:40:02,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:40:02,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1665490502, now seen corresponding path program 1 times [2023-12-21 23:40:02,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:40:02,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31042233] [2023-12-21 23:40:02,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:40:02,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-21 23:40:02,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:40:02,212 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-21 23:40:02,212 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-21 23:40:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:40:02,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-21 23:40:02,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:40:04,144 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 130 proven. 50 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-21 23:40:04,144 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:40:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 61 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:40:06,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:40:06,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31042233] [2023-12-21 23:40:06,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31042233] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:40:06,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:40:06,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 39 [2023-12-21 23:40:06,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353736627] [2023-12-21 23:40:06,167 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:40:06,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-21 23:40:06,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:40:06,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-21 23:40:06,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1318, Unknown=0, NotChecked=0, Total=1482 [2023-12-21 23:40:06,175 INFO L87 Difference]: Start difference. First operand 13176 states and 16512 transitions. Second operand has 39 states, 39 states have (on average 5.82051282051282) internal successors, (227), 39 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:40:46,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:40:46,524 INFO L93 Difference]: Finished difference Result 22991 states and 28244 transitions. [2023-12-21 23:40:46,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2023-12-21 23:40:46,526 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 5.82051282051282) internal successors, (227), 39 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2023-12-21 23:40:46,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:40:46,541 INFO L225 Difference]: With dead ends: 22991 [2023-12-21 23:40:46,541 INFO L226 Difference]: Without dead ends: 17726 [2023-12-21 23:40:46,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12543 ImplicationChecksByTransitivity, 35.9s TimeCoverageRelationStatistics Valid=4990, Invalid=30166, Unknown=0, NotChecked=0, Total=35156 [2023-12-21 23:40:46,551 INFO L413 NwaCegarLoop]: 1543 mSDtfsCounter, 26680 mSDsluCounter, 19046 mSDsCounter, 0 mSdLazyCounter, 2197 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26680 SdHoareTripleChecker+Valid, 20589 SdHoareTripleChecker+Invalid, 2354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 2197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-12-21 23:40:46,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26680 Valid, 20589 Invalid, 2354 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [157 Valid, 2197 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-12-21 23:40:46,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17726 states. [2023-12-21 23:40:47,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17726 to 15509. [2023-12-21 23:40:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15509 states, 15507 states have (on average 1.2406010188946928) internal successors, (19238), 15508 states have internal predecessors, (19238), 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-21 23:40:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15509 states to 15509 states and 19238 transitions. [2023-12-21 23:40:47,352 INFO L78 Accepts]: Start accepts. Automaton has 15509 states and 19238 transitions. Word has length 131 [2023-12-21 23:40:47,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:40:47,352 INFO L495 AbstractCegarLoop]: Abstraction has 15509 states and 19238 transitions. [2023-12-21 23:40:47,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.82051282051282) internal successors, (227), 39 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:40:47,352 INFO L276 IsEmpty]: Start isEmpty. Operand 15509 states and 19238 transitions. [2023-12-21 23:40:47,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-21 23:40:47,356 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:40:47,357 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:40:47,360 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 (28)] Forceful destruction successful, exit code 0 [2023-12-21 23:40:47,560 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-21 23:40:47,560 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:40:47,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:40:47,561 INFO L85 PathProgramCache]: Analyzing trace with hash -998141848, now seen corresponding path program 1 times [2023-12-21 23:40:47,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:40:47,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495567723] [2023-12-21 23:40:47,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:40:47,561 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-21 23:40:47,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:40:47,562 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-21 23:40:47,564 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-21 23:40:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:40:47,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-21 23:40:47,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:40:49,373 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 127 proven. 68 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-21 23:40:49,373 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:40:50,781 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 127 proven. 68 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-21 23:40:50,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:40:50,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495567723] [2023-12-21 23:40:50,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495567723] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:40:50,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:40:50,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-21 23:40:50,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552746981] [2023-12-21 23:40:50,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:40:50,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 23:40:50,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:40:50,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 23:40:50,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 23:40:50,782 INFO L87 Difference]: Start difference. First operand 15509 states and 19238 transitions. Second operand has 34 states, 34 states have (on average 6.029411764705882) internal successors, (205), 34 states have internal predecessors, (205), 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-21 23:41:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:41:20,497 INFO L93 Difference]: Finished difference Result 24507 states and 29959 transitions. [2023-12-21 23:41:20,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2023-12-21 23:41:20,498 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.029411764705882) internal successors, (205), 34 states have internal predecessors, (205), 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 132 [2023-12-21 23:41:20,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:41:20,515 INFO L225 Difference]: With dead ends: 24507 [2023-12-21 23:41:20,515 INFO L226 Difference]: Without dead ends: 17639 [2023-12-21 23:41:20,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7206 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=3210, Invalid=17382, Unknown=0, NotChecked=0, Total=20592 [2023-12-21 23:41:20,522 INFO L413 NwaCegarLoop]: 1535 mSDtfsCounter, 17057 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 1900 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17057 SdHoareTripleChecker+Valid, 19084 SdHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-12-21 23:41:20,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17057 Valid, 19084 Invalid, 1993 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [93 Valid, 1900 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2023-12-21 23:41:20,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17639 states. [2023-12-21 23:41:21,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17639 to 16414. [2023-12-21 23:41:21,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16414 states, 16412 states have (on average 1.2347063124543016) internal successors, (20264), 16413 states have internal predecessors, (20264), 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-21 23:41:21,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16414 states to 16414 states and 20264 transitions. [2023-12-21 23:41:21,298 INFO L78 Accepts]: Start accepts. Automaton has 16414 states and 20264 transitions. Word has length 132 [2023-12-21 23:41:21,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:41:21,299 INFO L495 AbstractCegarLoop]: Abstraction has 16414 states and 20264 transitions. [2023-12-21 23:41:21,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.029411764705882) internal successors, (205), 34 states have internal predecessors, (205), 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-21 23:41:21,299 INFO L276 IsEmpty]: Start isEmpty. Operand 16414 states and 20264 transitions. [2023-12-21 23:41:21,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-21 23:41:21,303 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:41:21,303 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:41:21,316 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-21 23:41:21,507 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-21 23:41:21,507 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:41:21,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:41:21,508 INFO L85 PathProgramCache]: Analyzing trace with hash 250812344, now seen corresponding path program 1 times [2023-12-21 23:41:21,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:41:21,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117365973] [2023-12-21 23:41:21,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:41:21,508 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-21 23:41:21,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:41:21,509 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-21 23:41:21,511 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-21 23:41:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:41:21,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-21 23:41:21,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:41:23,437 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 129 proven. 59 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-21 23:41:23,437 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:41:24,901 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 129 proven. 59 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-21 23:41:24,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:41:24,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117365973] [2023-12-21 23:41:24,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117365973] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:41:24,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:41:24,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-21 23:41:24,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926978010] [2023-12-21 23:41:24,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:41:24,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 23:41:24,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:41:24,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 23:41:24,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=989, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 23:41:24,903 INFO L87 Difference]: Start difference. First operand 16414 states and 20264 transitions. Second operand has 34 states, 34 states have (on average 5.764705882352941) internal successors, (196), 34 states have internal predecessors, (196), 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-21 23:41:55,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:41:55,718 INFO L93 Difference]: Finished difference Result 30383 states and 36972 transitions. [2023-12-21 23:41:55,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2023-12-21 23:41:55,719 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.764705882352941) internal successors, (196), 34 states have internal predecessors, (196), 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 132 [2023-12-21 23:41:55,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:41:55,737 INFO L225 Difference]: With dead ends: 30383 [2023-12-21 23:41:55,737 INFO L226 Difference]: Without dead ends: 23994 [2023-12-21 23:41:55,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10750 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=4570, Invalid=24842, Unknown=0, NotChecked=0, Total=29412 [2023-12-21 23:41:55,742 INFO L413 NwaCegarLoop]: 1571 mSDtfsCounter, 22159 mSDsluCounter, 14719 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22159 SdHoareTripleChecker+Valid, 16290 SdHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:41:55,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22159 Valid, 16290 Invalid, 1721 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [122 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-12-21 23:41:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23994 states. [2023-12-21 23:41:56,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23994 to 17921. [2023-12-21 23:41:56,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17921 states, 17919 states have (on average 1.232490652380155) internal successors, (22085), 17920 states have internal predecessors, (22085), 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-21 23:41:56,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17921 states to 17921 states and 22085 transitions. [2023-12-21 23:41:56,602 INFO L78 Accepts]: Start accepts. Automaton has 17921 states and 22085 transitions. Word has length 132 [2023-12-21 23:41:56,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:41:56,602 INFO L495 AbstractCegarLoop]: Abstraction has 17921 states and 22085 transitions. [2023-12-21 23:41:56,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.764705882352941) internal successors, (196), 34 states have internal predecessors, (196), 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-21 23:41:56,602 INFO L276 IsEmpty]: Start isEmpty. Operand 17921 states and 22085 transitions. [2023-12-21 23:41:56,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-21 23:41:56,606 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:41:56,606 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:41:56,610 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-21 23:41:56,809 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-21 23:41:56,809 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:41:56,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:41:56,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1794314758, now seen corresponding path program 1 times [2023-12-21 23:41:56,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:41:56,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111512075] [2023-12-21 23:41:56,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:41:56,811 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-21 23:41:56,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:41:56,812 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-21 23:41:56,813 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-21 23:41:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:41:56,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-21 23:41:56,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:41:58,984 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 132 proven. 50 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-21 23:41:58,984 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:42:00,850 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 128 proven. 68 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-21 23:42:00,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:42:00,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111512075] [2023-12-21 23:42:00,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111512075] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:42:00,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:42:00,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 36 [2023-12-21 23:42:00,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314014935] [2023-12-21 23:42:00,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:42:00,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-21 23:42:00,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:42:00,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-21 23:42:00,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2023-12-21 23:42:00,854 INFO L87 Difference]: Start difference. First operand 17921 states and 22085 transitions. Second operand has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 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-21 23:42:23,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:42:23,238 INFO L93 Difference]: Finished difference Result 35501 states and 43197 transitions. [2023-12-21 23:42:23,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2023-12-21 23:42:23,240 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 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 133 [2023-12-21 23:42:23,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:42:23,260 INFO L225 Difference]: With dead ends: 35501 [2023-12-21 23:42:23,260 INFO L226 Difference]: Without dead ends: 23219 [2023-12-21 23:42:23,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7109 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=4005, Invalid=16875, Unknown=0, NotChecked=0, Total=20880 [2023-12-21 23:42:23,269 INFO L413 NwaCegarLoop]: 1542 mSDtfsCounter, 19700 mSDsluCounter, 17461 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19700 SdHoareTripleChecker+Valid, 19003 SdHoareTripleChecker+Invalid, 2401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-21 23:42:23,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19700 Valid, 19003 Invalid, 2401 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-12-21 23:42:23,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23219 states. [2023-12-21 23:42:24,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23219 to 20996. [2023-12-21 23:42:24,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20996 states, 20994 states have (on average 1.2286843860150518) internal successors, (25795), 20995 states have internal predecessors, (25795), 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-21 23:42:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20996 states to 20996 states and 25795 transitions. [2023-12-21 23:42:24,458 INFO L78 Accepts]: Start accepts. Automaton has 20996 states and 25795 transitions. Word has length 133 [2023-12-21 23:42:24,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:42:24,458 INFO L495 AbstractCegarLoop]: Abstraction has 20996 states and 25795 transitions. [2023-12-21 23:42:24,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 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-21 23:42:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 20996 states and 25795 transitions. [2023-12-21 23:42:24,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-21 23:42:24,461 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:42:24,462 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-21 23:42:24,465 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 (31)] Ended with exit code 0 [2023-12-21 23:42:24,665 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-21 23:42:24,665 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:42:24,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:42:24,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1010440518, now seen corresponding path program 1 times [2023-12-21 23:42:24,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:42:24,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783736325] [2023-12-21 23:42:24,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:42:24,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-21 23:42:24,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:42:24,667 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-21 23:42:24,686 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-21 23:42:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:42:24,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 23:42:24,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:42:24,914 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 15 proven. 185 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-21 23:42:24,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:42:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 15 proven. 185 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-21 23:42:25,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:42:25,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783736325] [2023-12-21 23:42:25,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783736325] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:42:25,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:42:25,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-21 23:42:25,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373278056] [2023-12-21 23:42:25,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:42:25,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 23:42:25,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:42:25,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 23:42:25,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-21 23:42:25,136 INFO L87 Difference]: Start difference. First operand 20996 states and 25795 transitions. Second operand has 10 states, 10 states have (on average 21.6) internal successors, (216), 10 states have internal predecessors, (216), 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-21 23:42:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:42:28,469 INFO L93 Difference]: Finished difference Result 79059 states and 96403 transitions. [2023-12-21 23:42:28,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 23:42:28,469 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 21.6) internal successors, (216), 10 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2023-12-21 23:42:28,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:42:28,530 INFO L225 Difference]: With dead ends: 79059 [2023-12-21 23:42:28,530 INFO L226 Difference]: Without dead ends: 61702 [2023-12-21 23:42:28,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-21 23:42:28,543 INFO L413 NwaCegarLoop]: 1560 mSDtfsCounter, 3164 mSDsluCounter, 6316 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3164 SdHoareTripleChecker+Valid, 7876 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:42:28,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3164 Valid, 7876 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 23:42:28,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61702 states. [2023-12-21 23:42:32,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61702 to 60697. [2023-12-21 23:42:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60697 states, 60695 states have (on average 1.160952302496087) internal successors, (70464), 60696 states have internal predecessors, (70464), 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-21 23:42:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60697 states to 60697 states and 70464 transitions. [2023-12-21 23:42:32,126 INFO L78 Accepts]: Start accepts. Automaton has 60697 states and 70464 transitions. Word has length 134 [2023-12-21 23:42:32,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:42:32,127 INFO L495 AbstractCegarLoop]: Abstraction has 60697 states and 70464 transitions. [2023-12-21 23:42:32,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.6) internal successors, (216), 10 states have internal predecessors, (216), 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-21 23:42:32,127 INFO L276 IsEmpty]: Start isEmpty. Operand 60697 states and 70464 transitions. [2023-12-21 23:42:32,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-21 23:42:32,130 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:42:32,130 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:42:32,134 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 (32)] Ended with exit code 0 [2023-12-21 23:42:32,334 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-21 23:42:32,334 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:42:32,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:42:32,335 INFO L85 PathProgramCache]: Analyzing trace with hash 878356736, now seen corresponding path program 1 times [2023-12-21 23:42:32,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:42:32,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47996936] [2023-12-21 23:42:32,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:42:32,335 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-21 23:42:32,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:42:32,336 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-21 23:42:32,337 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-21 23:42:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 23:42:32,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 23:42:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 23:42:32,558 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-21 23:42:32,558 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 23:42:32,559 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-21 23:42:32,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-21 23:42:32,581 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-21 23:42:32,782 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-21 23:42:32,785 INFO L445 BasicCegarLoop]: Path program histogram: [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] [2023-12-21 23:42:32,788 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 23:42:32,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 11:42:32 BoogieIcfgContainer [2023-12-21 23:42:32,890 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 23:42:32,890 INFO L158 Benchmark]: Toolchain (without parser) took 316797.48ms. Allocated memory was 234.9MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 174.6MB in the beginning and 888.3MB in the end (delta: -713.7MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2023-12-21 23:42:32,890 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 195.0MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 23:42:32,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1299.05ms. Allocated memory was 234.9MB in the beginning and 315.6MB in the end (delta: 80.7MB). Free memory was 174.1MB in the beginning and 212.1MB in the end (delta: -38.0MB). Peak memory consumption was 102.5MB. Max. memory is 8.0GB. [2023-12-21 23:42:32,893 INFO L158 Benchmark]: Boogie Procedure Inliner took 151.25ms. Allocated memory is still 315.6MB. Free memory was 212.1MB in the beginning and 176.5MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-12-21 23:42:32,894 INFO L158 Benchmark]: Boogie Preprocessor took 239.53ms. Allocated memory is still 315.6MB. Free memory was 176.5MB in the beginning and 138.7MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2023-12-21 23:42:32,894 INFO L158 Benchmark]: RCFGBuilder took 24765.80ms. Allocated memory was 315.6MB in the beginning and 631.2MB in the end (delta: 315.6MB). Free memory was 138.7MB in the beginning and 378.9MB in the end (delta: -240.1MB). Peak memory consumption was 209.3MB. Max. memory is 8.0GB. [2023-12-21 23:42:32,894 INFO L158 Benchmark]: TraceAbstraction took 290335.54ms. Allocated memory was 631.2MB in the beginning and 2.5GB in the end (delta: 1.9GB). Free memory was 378.3MB in the beginning and 888.3MB in the end (delta: -509.9MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2023-12-21 23:42:32,894 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.15ms. Allocated memory is still 195.0MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1299.05ms. Allocated memory was 234.9MB in the beginning and 315.6MB in the end (delta: 80.7MB). Free memory was 174.1MB in the beginning and 212.1MB in the end (delta: -38.0MB). Peak memory consumption was 102.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 151.25ms. Allocated memory is still 315.6MB. Free memory was 212.1MB in the beginning and 176.5MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 239.53ms. Allocated memory is still 315.6MB. Free memory was 176.5MB in the beginning and 138.7MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * RCFGBuilder took 24765.80ms. Allocated memory was 315.6MB in the beginning and 631.2MB in the end (delta: 315.6MB). Free memory was 138.7MB in the beginning and 378.9MB in the end (delta: -240.1MB). Peak memory consumption was 209.3MB. Max. memory is 8.0GB. * TraceAbstraction took 290335.54ms. Allocated memory was 631.2MB in the beginning and 2.5GB in the end (delta: 1.9GB). Free memory was 378.3MB in the beginning and 888.3MB in the end (delta: -509.9MB). Peak memory consumption was 1.4GB. 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: 292]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L35] msg_t nomsg = (msg_t )-1; [L36] char r1 ; [L37] port_t p1 ; [L38] char p1_old ; [L39] char p1_new ; [L40] char id1 ; [L41] char st1 ; [L42] msg_t send1 ; [L43] _Bool mode1 ; [L44] port_t p2 ; [L45] char p2_old ; [L46] char p2_new ; [L47] char id2 ; [L48] char st2 ; [L49] msg_t send2 ; [L50] _Bool mode2 ; [L51] port_t p3 ; [L52] char p3_old ; [L53] char p3_new ; [L54] char id3 ; [L55] char st3 ; [L56] msg_t send3 ; [L57] _Bool mode3 ; [L308] int inputC = 3; [L309] int inputF = 6; [L310] int inputA = 1; [L311] int inputB = 2; [L312] int inputD = 4; [L313] int inputE = 5; [L316] int a17 = -124; [L317] int a5 = 4; [L318] int a24 = 15; [L319] int a2 = 170; [L320] int a7 = 13; [L5128] COND TRUE __VERIFIER_nondet_int() [L5129] CALL main1() [L239] int c1 ; [L240] int i2 ; [L243] c1 = 0 [L244] r1 = __VERIFIER_nondet_char() [L245] id1 = __VERIFIER_nondet_char() [L246] st1 = __VERIFIER_nondet_char() [L247] send1 = __VERIFIER_nondet_char() [L248] mode1 = __VERIFIER_nondet_bool() [L249] id2 = __VERIFIER_nondet_char() [L250] st2 = __VERIFIER_nondet_char() [L251] send2 = __VERIFIER_nondet_char() [L252] mode2 = __VERIFIER_nondet_bool() [L253] id3 = __VERIFIER_nondet_char() [L254] st3 = __VERIFIER_nondet_char() [L255] send3 = __VERIFIER_nondet_char() [L256] mode3 = __VERIFIER_nondet_bool() [L257] CALL, EXPR init() [L138] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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] [L141] COND TRUE (int )r1 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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] [L142] COND TRUE (int )id1 >= 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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] [L143] COND TRUE (int )st1 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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] [L144] COND TRUE (int )send1 == (int )id1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=64, st1=0] [L145] COND TRUE (int )mode1 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=64, st1=0] [L146] COND TRUE (int )id2 >= 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=64, st1=0] [L147] COND TRUE (int )st2 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=64, st1=0, st2=0] [L148] COND TRUE (int )send2 == (int )id2 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=64, send2=32, st1=0, st2=0] [L149] COND TRUE (int )mode2 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=64, send2=32, st1=0, st2=0] [L150] COND TRUE (int )id3 >= 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=64, send2=32, st1=0, st2=0] [L151] COND TRUE (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=64, send2=32, st1=0, st2=0, st3=0] [L152] COND TRUE (int )send3 == (int )id3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L153] COND TRUE (int )mode3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L154] COND TRUE (int )id1 != (int )id2 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L155] COND TRUE (int )id1 != (int )id3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L156] COND TRUE (int )id2 != (int )id3 [L157] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=64, send2=32, send3=0, st1=0, st2=0, st3=0, tmp=1] [L206] return (tmp); [L257] RET, EXPR init() [L257] i2 = init() [L258] COND FALSE !(!(i2)) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=0, i2=1, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L259] p1_old = nomsg [L260] p1_new = nomsg [L261] p2_old = nomsg [L262] p2_new = nomsg [L263] p3_old = nomsg [L264] p3_new = nomsg [L265] i2 = 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=0, i2=0, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L64] COND FALSE !(\read(mode1)) [L80] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L81] mode1 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L92] COND FALSE !(\read(mode2)) [L105] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L106] mode2 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=32, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=32, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L117] COND FALSE !(\read(mode3)) [L130] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L131] mode3 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=32, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L215] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L218] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L220] COND TRUE (int )r1 < 3 [L221] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0, tmp=1] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L278] RET assert(c1) [L279] i2 ++ VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=1, i2=1, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L64] COND TRUE \read(mode1) [L65] r1 = (char )((int )r1 + 1) [L66] m1 = p3_old [L67] p3_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L68] COND TRUE (int )m1 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L69] COND FALSE !((int )m1 > (int )id1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L72] COND FALSE !((int )m1 == (int )id1) [L75] send1 = m1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L78] mode1 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L92] COND TRUE \read(mode2) [L93] m2 = p1_old [L94] p1_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L95] COND TRUE (int )m2 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L96] COND TRUE (int )m2 > (int )id2 [L97] send2 = m2 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L103] mode2 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=64, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L117] COND TRUE \read(mode3) [L118] m3 = p2_old [L119] p2_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=32, 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=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L120] COND TRUE (int )m3 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=32, 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=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L121] COND TRUE (int )m3 > (int )id3 [L122] send3 = m3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=32, 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=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L128] mode3 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=32, 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=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L215] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L218] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L220] COND TRUE (int )r1 < 3 [L221] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=0, send2=64, send3=32, st1=0, st2=0, st3=0, tmp=1] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L278] RET assert(c1) [L279] i2 ++ VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=1, i2=2, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L64] COND FALSE !(\read(mode1)) [L80] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L81] mode1 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, 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=32, st1=0, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, 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=32, st1=0, st2=0, st3=0] [L92] COND FALSE !(\read(mode2)) [L105] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L106] mode2 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L117] COND FALSE !(\read(mode3)) [L130] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L131] mode3 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=32, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L215] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L218] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L220] COND TRUE (int )r1 < 3 [L221] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0, tmp=1] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L278] RET assert(c1) [L279] i2 ++ VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=1, i2=3, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L64] COND TRUE \read(mode1) [L65] r1 = (char )((int )r1 + 1) [L66] m1 = p3_old [L67] p3_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L68] COND TRUE (int )m1 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L69] COND FALSE !((int )m1 > (int )id1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L72] COND FALSE !((int )m1 == (int )id1) [L75] send1 = m1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L78] mode1 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=32, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L92] COND TRUE \read(mode2) [L93] m2 = p1_old [L94] p1_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L95] COND TRUE (int )m2 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L96] COND FALSE !((int )m2 > (int )id2) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L99] COND FALSE !((int )m2 == (int )id2) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L103] mode2 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L117] COND TRUE \read(mode3) [L118] m3 = p2_old [L119] p2_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, 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=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L120] COND TRUE (int )m3 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, 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=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L121] COND TRUE (int )m3 > (int )id3 [L122] send3 = m3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, 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=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L128] mode3 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, 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=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L215] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L218] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L220] COND TRUE (int )r1 < 3 [L221] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=32, send2=64, send3=64, st1=0, st2=0, st3=0, tmp=1] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L278] RET assert(c1) [L279] i2 ++ VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=1, i2=4, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L64] COND FALSE !(\read(mode1)) [L80] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L81] mode1 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L92] COND FALSE !(\read(mode2)) [L105] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L106] mode2 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L117] COND FALSE !(\read(mode3)) [L130] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L131] mode3 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=64, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L215] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L218] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L220] COND TRUE (int )r1 < 3 [L221] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0, tmp=1] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L278] RET assert(c1) [L279] i2 ++ VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=1, i2=5, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L64] COND TRUE \read(mode1) [L65] r1 = (char )((int )r1 + 1) [L66] m1 = p3_old [L67] p3_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L68] COND TRUE (int )m1 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L69] COND FALSE !((int )m1 > (int )id1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L72] COND TRUE (int )m1 == (int )id1 [L73] st1 = (char)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L78] mode1 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L92] COND TRUE \read(mode2) [L93] m2 = p1_old [L94] p1_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=32, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L95] COND TRUE (int )m2 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=32, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L96] COND FALSE !((int )m2 > (int )id2) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=32, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L99] COND TRUE (int )m2 == (int )id2 [L100] st2 = (char)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=32, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L103] mode2 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=32, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L117] COND TRUE \read(mode3) [L118] m3 = p2_old [L119] p2_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, 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=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L120] COND TRUE (int )m3 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, 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=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L121] COND TRUE (int )m3 > (int )id3 [L122] send3 = m3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, 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=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L128] mode3 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, 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=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L214] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L232] tmp = 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=32, send2=64, send3=64, st1=1, st2=1, st3=0, tmp=0] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND TRUE ! arg VAL [\old(arg)=0, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=0, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L292] reach_error() VAL [\old(arg)=0, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=0, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=32, send2=64, send3=64, st1=1, st2=1, st3=0] - UnprovableResult [Line: 490]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 807 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 290.2s, OverallIterations: 32, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 243.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 189823 SdHoareTripleChecker+Valid, 97.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 189823 mSDsluCounter, 277155 SdHoareTripleChecker+Invalid, 83.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 231826 mSDsCounter, 1497 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24919 IncrementalHoareTripleChecker+Invalid, 26416 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1497 mSolverCounterUnsat, 45329 mSDtfsCounter, 24919 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4834 GetRequests, 3514 SyntacticMatches, 1 SemanticMatches, 1319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74950 ImplicationChecksByTransitivity, 146.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60697occurred in iteration=31, InterpolantAutomatonStates: 1091, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 15809 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 28.4s InterpolantComputationTime, 2584 NumberOfCodeBlocks, 2320 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3876 ConstructedInterpolants, 807 QuantifiedInterpolants, 47327 SizeOfPredicates, 136 NumberOfNonLiveVariables, 5337 ConjunctsInSsa, 261 ConjunctsInUnsatCore, 46 InterpolantComputations, 16 PerfectInterpolantSequences, 2388/4268 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-21 23:42:33,000 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...