/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_label09.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 23:37:26,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 23:37:26,620 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:26,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 23:37:26,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 23:37:26,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 23:37:26,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 23:37:26,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 23:37:26,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 23:37:26,653 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 23:37:26,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 23:37:26,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 23:37:26,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 23:37:26,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 23:37:26,655 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 23:37:26,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 23:37:26,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 23:37:26,655 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 23:37:26,655 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 23:37:26,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 23:37:26,656 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 23:37:26,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 23:37:26,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 23:37:26,656 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 23:37:26,656 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 23:37:26,657 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 23:37:26,657 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 23:37:26,657 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 23:37:26,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 23:37:26,657 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 23:37:26,658 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 23:37:26,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 23:37:26,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 23:37:26,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 23:37:26,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 23:37:26,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 23:37:26,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 23:37:26,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 23:37:26,659 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 23:37:26,659 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 23:37:26,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 23:37:26,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 23:37:26,659 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 23:37:26,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 23:37:26,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 23:37:26,660 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 23:37:26,660 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:26,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 23:37:26,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 23:37:26,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 23:37:26,864 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 23:37:26,864 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 23:37:26,865 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_label09.c [2023-12-21 23:37:27,821 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 23:37:28,183 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 23:37:28,184 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label09.c [2023-12-21 23:37:28,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1278a656e/93a1921abc344652a81b5a932ae07635/FLAG33054ced7 [2023-12-21 23:37:28,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1278a656e/93a1921abc344652a81b5a932ae07635 [2023-12-21 23:37:28,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 23:37:28,225 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 23:37:28,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 23:37:28,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 23:37:28,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 23:37:28,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:37:28" (1/1) ... [2023-12-21 23:37:28,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d67bb13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:28, skipping insertion in model container [2023-12-21 23:37:28,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:37:28" (1/1) ... [2023-12-21 23:37:28,312 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 23:37:28,554 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_label09.c[6391,6404] [2023-12-21 23:37:28,606 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_label09.c[14139,14152] [2023-12-21 23:37:29,140 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 23:37:29,153 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 23:37:29,183 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_label09.c[6391,6404] [2023-12-21 23:37:29,195 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label09.c[14139,14152] [2023-12-21 23:37:29,553 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 23:37:29,573 INFO L206 MainTranslator]: Completed translation [2023-12-21 23:37:29,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:29 WrapperNode [2023-12-21 23:37:29,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 23:37:29,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 23:37:29,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 23:37:29,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 23:37:29,580 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:29" (1/1) ... [2023-12-21 23:37:29,639 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:29" (1/1) ... [2023-12-21 23:37:29,744 INFO L138 Inliner]: procedures = 34, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4962 [2023-12-21 23:37:29,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 23:37:29,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 23:37:29,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 23:37:29,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 23:37:29,752 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:29" (1/1) ... [2023-12-21 23:37:29,752 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:29" (1/1) ... [2023-12-21 23:37:29,789 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:29" (1/1) ... [2023-12-21 23:37:29,850 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:29,850 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:29" (1/1) ... [2023-12-21 23:37:29,850 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:29" (1/1) ... [2023-12-21 23:37:29,918 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:29" (1/1) ... [2023-12-21 23:37:29,939 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:29" (1/1) ... [2023-12-21 23:37:29,969 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:29" (1/1) ... [2023-12-21 23:37:29,983 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:29" (1/1) ... [2023-12-21 23:37:30,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 23:37:30,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 23:37:30,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 23:37:30,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 23:37:30,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:29" (1/1) ... [2023-12-21 23:37:30,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 23:37:30,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 23:37:30,049 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:30,081 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:30,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 23:37:30,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 23:37:30,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 23:37:30,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 23:37:30,270 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 23:37:30,272 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 23:37:53,858 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 23:37:53,905 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 23:37:53,905 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-21 23:37:53,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:37:53 BoogieIcfgContainer [2023-12-21 23:37:53,906 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 23:37:53,907 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 23:37:53,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 23:37:53,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 23:37:53,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 11:37:28" (1/3) ... [2023-12-21 23:37:53,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9355ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:37:53, skipping insertion in model container [2023-12-21 23:37:53,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:29" (2/3) ... [2023-12-21 23:37:53,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9355ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:37:53, skipping insertion in model container [2023-12-21 23:37:53,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:37:53" (3/3) ... [2023-12-21 23:37:53,911 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label09.c [2023-12-21 23:37:53,922 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 23:37:53,922 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-21 23:37:53,963 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 23:37:53,967 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;@67e59d1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 23:37:53,967 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-21 23:37:53,974 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:53,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 23:37:53,978 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:53,979 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:53,979 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:53,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:53,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1947968790, now seen corresponding path program 1 times [2023-12-21 23:37:53,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:53,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231826568] [2023-12-21 23:37:53,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:53,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:37:53,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:53,994 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:54,015 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:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:54,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 23:37:54,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:54,107 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:54,108 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:54,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:54,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231826568] [2023-12-21 23:37:54,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231826568] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:54,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:54,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 23:37:54,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666475314] [2023-12-21 23:37:54,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:54,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 23:37:54,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:54,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 23:37:54,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 23:37:54,136 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:54,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:54,231 INFO L93 Difference]: Finished difference Result 1594 states and 3146 transitions. [2023-12-21 23:37:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 23:37:54,233 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:54,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:54,249 INFO L225 Difference]: With dead ends: 1594 [2023-12-21 23:37:54,249 INFO L226 Difference]: Without dead ends: 803 [2023-12-21 23:37:54,255 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:54,257 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:54,258 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:54,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2023-12-21 23:37:54,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2023-12-21 23:37:54,329 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:54,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1521 transitions. [2023-12-21 23:37:54,332 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1521 transitions. Word has length 17 [2023-12-21 23:37:54,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:54,332 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1521 transitions. [2023-12-21 23:37:54,332 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:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1521 transitions. [2023-12-21 23:37:54,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 23:37:54,333 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:54,333 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:54,340 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:54,540 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:54,540 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:54,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:54,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1760192492, now seen corresponding path program 1 times [2023-12-21 23:37:54,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:54,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238935143] [2023-12-21 23:37:54,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:54,542 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:54,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:54,543 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:54,617 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:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:54,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:37:54,657 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:54,712 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:54,712 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:54,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:54,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238935143] [2023-12-21 23:37:54,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238935143] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:54,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:54,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 23:37:54,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739767598] [2023-12-21 23:37:54,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:54,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 23:37:54,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:54,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 23:37:54,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 23:37:54,715 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:54,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:54,793 INFO L93 Difference]: Finished difference Result 864 states and 1616 transitions. [2023-12-21 23:37:54,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 23:37:54,794 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:54,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:54,796 INFO L225 Difference]: With dead ends: 864 [2023-12-21 23:37:54,796 INFO L226 Difference]: Without dead ends: 832 [2023-12-21 23:37:54,797 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:54,797 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.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:54,798 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.1s Time] [2023-12-21 23:37:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2023-12-21 23:37:54,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 803. [2023-12-21 23:37:54,809 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:54,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1505 transitions. [2023-12-21 23:37:54,811 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1505 transitions. Word has length 17 [2023-12-21 23:37:54,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:54,811 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1505 transitions. [2023-12-21 23:37:54,811 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:54,811 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1505 transitions. [2023-12-21 23:37:54,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-21 23:37:54,812 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:54,812 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:54,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-21 23:37:55,017 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:55,018 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:55,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:55,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1166183952, now seen corresponding path program 1 times [2023-12-21 23:37:55,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:55,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214288785] [2023-12-21 23:37:55,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:55,020 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:55,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:55,022 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:55,040 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:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:55,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:37:55,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:55,269 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:55,269 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:55,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:55,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214288785] [2023-12-21 23:37:55,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [214288785] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:55,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:55,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 23:37:55,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675167414] [2023-12-21 23:37:55,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:55,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 23:37:55,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:55,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 23:37:55,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:37:55,271 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:55,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:55,365 INFO L93 Difference]: Finished difference Result 919 states and 1689 transitions. [2023-12-21 23:37:55,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:37:55,367 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:55,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:55,369 INFO L225 Difference]: With dead ends: 919 [2023-12-21 23:37:55,369 INFO L226 Difference]: Without dead ends: 890 [2023-12-21 23:37:55,370 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:55,371 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:55,371 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:55,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2023-12-21 23:37:55,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 857. [2023-12-21 23:37:55,384 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:55,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1592 transitions. [2023-12-21 23:37:55,387 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1592 transitions. Word has length 32 [2023-12-21 23:37:55,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:55,387 INFO L495 AbstractCegarLoop]: Abstraction has 857 states and 1592 transitions. [2023-12-21 23:37:55,387 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:55,387 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1592 transitions. [2023-12-21 23:37:55,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 23:37:55,388 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:55,388 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:55,411 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:55,591 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:55,591 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:55,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:55,592 INFO L85 PathProgramCache]: Analyzing trace with hash 160996032, now seen corresponding path program 1 times [2023-12-21 23:37:55,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:55,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110268345] [2023-12-21 23:37:55,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:55,593 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:55,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:55,599 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:55,602 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:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:55,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:55,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:55,710 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:55,710 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:55,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:55,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110268345] [2023-12-21 23:37:55,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110268345] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:55,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:55,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:37:55,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877572688] [2023-12-21 23:37:55,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:55,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:55,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:55,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:55,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:55,721 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:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:55,755 INFO L93 Difference]: Finished difference Result 1007 states and 1830 transitions. [2023-12-21 23:37:55,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:37:55,756 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:55,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:55,759 INFO L225 Difference]: With dead ends: 1007 [2023-12-21 23:37:55,759 INFO L226 Difference]: Without dead ends: 924 [2023-12-21 23:37:55,759 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:55,760 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:55,761 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:55,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2023-12-21 23:37:55,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 922. [2023-12-21 23:37:55,819 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:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1691 transitions. [2023-12-21 23:37:55,821 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1691 transitions. Word has length 34 [2023-12-21 23:37:55,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:55,821 INFO L495 AbstractCegarLoop]: Abstraction has 922 states and 1691 transitions. [2023-12-21 23:37:55,821 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:55,822 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1691 transitions. [2023-12-21 23:37:55,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-21 23:37:55,822 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:55,823 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:55,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-21 23:37:56,023 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:56,023 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:56,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:56,025 INFO L85 PathProgramCache]: Analyzing trace with hash 634048377, now seen corresponding path program 1 times [2023-12-21 23:37:56,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:56,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215422897] [2023-12-21 23:37:56,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:56,025 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:56,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:56,026 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:56,034 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:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:56,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 23:37:56,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:56,098 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:56,098 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:56,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:56,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215422897] [2023-12-21 23:37:56,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215422897] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:56,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:56,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 23:37:56,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433494805] [2023-12-21 23:37:56,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:56,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 23:37:56,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:56,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 23:37:56,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 23:37:56,099 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:56,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:56,148 INFO L93 Difference]: Finished difference Result 936 states and 1708 transitions. [2023-12-21 23:37:56,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 23:37:56,149 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:56,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:56,152 INFO L225 Difference]: With dead ends: 936 [2023-12-21 23:37:56,152 INFO L226 Difference]: Without dead ends: 934 [2023-12-21 23:37:56,152 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:56,152 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:56,153 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:56,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2023-12-21 23:37:56,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 930. [2023-12-21 23:37:56,164 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:56,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1698 transitions. [2023-12-21 23:37:56,166 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1698 transitions. Word has length 35 [2023-12-21 23:37:56,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:56,166 INFO L495 AbstractCegarLoop]: Abstraction has 930 states and 1698 transitions. [2023-12-21 23:37:56,166 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:56,166 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1698 transitions. [2023-12-21 23:37:56,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 23:37:56,167 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:56,167 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:56,172 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:56,370 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:56,370 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:56,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:56,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1174229944, now seen corresponding path program 1 times [2023-12-21 23:37:56,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:56,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041565750] [2023-12-21 23:37:56,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:56,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:37:56,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:56,372 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:56,383 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:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:56,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:56,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:56,459 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:56,459 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:56,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:56,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041565750] [2023-12-21 23:37:56,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041565750] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:56,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:56,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:37:56,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905685488] [2023-12-21 23:37:56,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:56,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:56,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:56,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:56,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:56,460 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:56,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:56,487 INFO L93 Difference]: Finished difference Result 1098 states and 1958 transitions. [2023-12-21 23:37:56,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:37:56,488 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:56,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:56,491 INFO L225 Difference]: With dead ends: 1098 [2023-12-21 23:37:56,491 INFO L226 Difference]: Without dead ends: 1009 [2023-12-21 23:37:56,491 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:56,492 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:56,492 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:56,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2023-12-21 23:37:56,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1007. [2023-12-21 23:37:56,504 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:56,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1814 transitions. [2023-12-21 23:37:56,506 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1814 transitions. Word has length 36 [2023-12-21 23:37:56,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:56,506 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1814 transitions. [2023-12-21 23:37:56,506 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:56,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1814 transitions. [2023-12-21 23:37:56,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 23:37:56,507 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:56,507 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:56,515 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:56,710 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:56,711 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:56,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:56,711 INFO L85 PathProgramCache]: Analyzing trace with hash 548573880, now seen corresponding path program 1 times [2023-12-21 23:37:56,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:56,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614562168] [2023-12-21 23:37:56,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:56,712 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:56,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:56,713 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:56,741 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:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:56,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:56,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:56,786 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:56,786 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:56,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:56,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614562168] [2023-12-21 23:37:56,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614562168] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:56,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:56,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:37:56,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147358890] [2023-12-21 23:37:56,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:56,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:56,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:56,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:56,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:56,788 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:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:56,824 INFO L93 Difference]: Finished difference Result 1433 states and 2457 transitions. [2023-12-21 23:37:56,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:37:56,825 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:56,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:56,829 INFO L225 Difference]: With dead ends: 1433 [2023-12-21 23:37:56,829 INFO L226 Difference]: Without dead ends: 1202 [2023-12-21 23:37:56,830 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:56,830 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:56,831 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:56,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2023-12-21 23:37:56,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1200. [2023-12-21 23:37:56,847 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:56,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 2094 transitions. [2023-12-21 23:37:56,849 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 2094 transitions. Word has length 36 [2023-12-21 23:37:56,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:56,850 INFO L495 AbstractCegarLoop]: Abstraction has 1200 states and 2094 transitions. [2023-12-21 23:37:56,850 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:56,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 2094 transitions. [2023-12-21 23:37:56,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 23:37:56,851 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:56,851 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:56,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-21 23:37:57,054 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:57,055 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:57,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:57,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1437307320, now seen corresponding path program 1 times [2023-12-21 23:37:57,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:57,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331458833] [2023-12-21 23:37:57,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:57,056 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:57,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:57,057 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:57,083 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:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:57,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:57,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:57,127 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:57,127 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:57,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:57,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331458833] [2023-12-21 23:37:57,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331458833] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:57,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:57,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:37:57,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973260276] [2023-12-21 23:37:57,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:57,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:57,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:57,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:57,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:57,132 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:57,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:57,164 INFO L93 Difference]: Finished difference Result 1976 states and 3234 transitions. [2023-12-21 23:37:57,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:37:57,165 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:57,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:57,169 INFO L225 Difference]: With dead ends: 1976 [2023-12-21 23:37:57,169 INFO L226 Difference]: Without dead ends: 1552 [2023-12-21 23:37:57,170 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:57,171 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:57,171 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:57,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2023-12-21 23:37:57,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1550. [2023-12-21 23:37:57,193 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:57,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2582 transitions. [2023-12-21 23:37:57,196 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2582 transitions. Word has length 36 [2023-12-21 23:37:57,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:57,196 INFO L495 AbstractCegarLoop]: Abstraction has 1550 states and 2582 transitions. [2023-12-21 23:37:57,196 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:57,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2582 transitions. [2023-12-21 23:37:57,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-21 23:37:57,197 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:57,198 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:57,201 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:57,400 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:57,401 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:57,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:57,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1394266792, now seen corresponding path program 1 times [2023-12-21 23:37:57,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:57,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154554757] [2023-12-21 23:37:57,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:57,402 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:57,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:57,403 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:57,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 (10)] Waiting until timeout for monitored process [2023-12-21 23:37:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:57,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-21 23:37:57,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:57,978 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:57,978 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:37:58,197 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:58,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:58,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154554757] [2023-12-21 23:37:58,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154554757] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:37:58,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:37:58,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-21 23:37:58,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211202357] [2023-12-21 23:37:58,197 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:37:58,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 23:37:58,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:58,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 23:37:58,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-21 23:37:58,198 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:59,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:59,860 INFO L93 Difference]: Finished difference Result 3268 states and 5027 transitions. [2023-12-21 23:37:59,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 23:37:59,860 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:59,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:59,868 INFO L225 Difference]: With dead ends: 3268 [2023-12-21 23:37:59,868 INFO L226 Difference]: Without dead ends: 2714 [2023-12-21 23:37:59,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2023-12-21 23:37:59,871 INFO L413 NwaCegarLoop]: 1500 mSDtfsCounter, 3325 mSDsluCounter, 13527 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:59,871 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.9s Time] [2023-12-21 23:37:59,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2023-12-21 23:37:59,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2322. [2023-12-21 23:37:59,918 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:59,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 3690 transitions. [2023-12-21 23:37:59,922 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 3690 transitions. Word has length 50 [2023-12-21 23:37:59,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:59,922 INFO L495 AbstractCegarLoop]: Abstraction has 2322 states and 3690 transitions. [2023-12-21 23:37:59,922 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:59,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 3690 transitions. [2023-12-21 23:37:59,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-21 23:37:59,923 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:59,923 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:59,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-21 23:38:00,127 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:38:00,127 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:00,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:00,128 INFO L85 PathProgramCache]: Analyzing trace with hash 768610728, now seen corresponding path program 1 times [2023-12-21 23:38:00,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:00,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163990827] [2023-12-21 23:38:00,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:00,128 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:00,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:00,154 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:38:00,184 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:38:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:00,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:38:00,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:00,278 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:38:00,278 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:00,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:00,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163990827] [2023-12-21 23:38:00,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163990827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:00,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:00,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:38:00,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192343514] [2023-12-21 23:38:00,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:00,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:38:00,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:00,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:38:00,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:38:00,279 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:38:00,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:00,328 INFO L93 Difference]: Finished difference Result 3444 states and 5327 transitions. [2023-12-21 23:38:00,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:38:00,329 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:38:00,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:00,335 INFO L225 Difference]: With dead ends: 3444 [2023-12-21 23:38:00,335 INFO L226 Difference]: Without dead ends: 1898 [2023-12-21 23:38:00,338 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:38:00,339 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:38:00,339 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:38:00,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2023-12-21 23:38:00,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1891. [2023-12-21 23:38:00,374 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:38:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 3067 transitions. [2023-12-21 23:38:00,377 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 3067 transitions. Word has length 50 [2023-12-21 23:38:00,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:00,378 INFO L495 AbstractCegarLoop]: Abstraction has 1891 states and 3067 transitions. [2023-12-21 23:38:00,378 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:38:00,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 3067 transitions. [2023-12-21 23:38:00,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-21 23:38:00,379 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:00,379 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:38:00,404 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:38:00,582 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:38:00,583 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:00,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:00,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1146343880, now seen corresponding path program 1 times [2023-12-21 23:38:00,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:00,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112788732] [2023-12-21 23:38:00,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:00,584 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:00,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:00,587 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:38:00,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-21 23:38:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:00,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:38:00,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:00,667 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:38:00,667 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:00,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:00,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112788732] [2023-12-21 23:38:00,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112788732] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:00,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:00,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:38:00,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810090563] [2023-12-21 23:38:00,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:00,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:38:00,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:00,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:38:00,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:38:00,668 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:38:00,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:00,704 INFO L93 Difference]: Finished difference Result 2447 states and 3867 transitions. [2023-12-21 23:38:00,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:38:00,705 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:38:00,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:00,709 INFO L225 Difference]: With dead ends: 2447 [2023-12-21 23:38:00,709 INFO L226 Difference]: Without dead ends: 1341 [2023-12-21 23:38:00,710 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:38:00,710 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:38:00,710 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:38:00,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2023-12-21 23:38:00,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1339. [2023-12-21 23:38:00,731 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:38:00,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2257 transitions. [2023-12-21 23:38:00,733 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2257 transitions. Word has length 52 [2023-12-21 23:38:00,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:00,733 INFO L495 AbstractCegarLoop]: Abstraction has 1339 states and 2257 transitions. [2023-12-21 23:38:00,734 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:38:00,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2257 transitions. [2023-12-21 23:38:00,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-21 23:38:00,734 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:00,734 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:38:00,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-12-21 23:38:00,937 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:38:00,937 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:00,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:00,937 INFO L85 PathProgramCache]: Analyzing trace with hash 846633098, now seen corresponding path program 1 times [2023-12-21 23:38:00,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:00,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103478649] [2023-12-21 23:38:00,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:00,938 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:00,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:00,954 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:38:00,955 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:38:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:01,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-21 23:38:01,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:01,635 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:38:01,636 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:01,877 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:38:01,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:01,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103478649] [2023-12-21 23:38:01,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103478649] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:01,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:01,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-21 23:38:01,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597567543] [2023-12-21 23:38:01,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:01,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 23:38:01,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:01,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 23:38:01,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-21 23:38:01,879 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:38:02,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:02,494 INFO L93 Difference]: Finished difference Result 1933 states and 3088 transitions. [2023-12-21 23:38:02,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 23:38:02,495 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:38:02,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:02,498 INFO L225 Difference]: With dead ends: 1933 [2023-12-21 23:38:02,498 INFO L226 Difference]: Without dead ends: 1379 [2023-12-21 23:38:02,499 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:38:02,499 INFO L413 NwaCegarLoop]: 1474 mSDtfsCounter, 4481 mSDsluCounter, 11786 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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:38:02,500 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:38:02,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2023-12-21 23:38:02,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1353. [2023-12-21 23:38:02,521 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:38:02,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2273 transitions. [2023-12-21 23:38:02,522 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 2273 transitions. Word has length 53 [2023-12-21 23:38:02,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:02,523 INFO L495 AbstractCegarLoop]: Abstraction has 1353 states and 2273 transitions. [2023-12-21 23:38:02,523 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:38:02,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 2273 transitions. [2023-12-21 23:38:02,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-21 23:38:02,523 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:02,523 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:38:02,529 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:38:02,726 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:38:02,727 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:02,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:02,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1583889782, now seen corresponding path program 1 times [2023-12-21 23:38:02,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:02,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178164654] [2023-12-21 23:38:02,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:02,727 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:02,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:02,743 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:38:02,768 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:38:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:02,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:38:02,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:02,829 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:38:02,830 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:02,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:02,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1178164654] [2023-12-21 23:38:02,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1178164654] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:02,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:02,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:38:02,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891311728] [2023-12-21 23:38:02,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:02,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:38:02,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:02,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:38:02,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:38:02,831 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:38:02,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:02,859 INFO L93 Difference]: Finished difference Result 1633 states and 2665 transitions. [2023-12-21 23:38:02,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:38:02,860 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:38:02,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:02,862 INFO L225 Difference]: With dead ends: 1633 [2023-12-21 23:38:02,862 INFO L226 Difference]: Without dead ends: 1079 [2023-12-21 23:38:02,863 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:38:02,864 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:38:02,864 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:38:02,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2023-12-21 23:38:02,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1077. [2023-12-21 23:38:02,880 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:38:02,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1871 transitions. [2023-12-21 23:38:02,881 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1871 transitions. Word has length 55 [2023-12-21 23:38:02,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:02,881 INFO L495 AbstractCegarLoop]: Abstraction has 1077 states and 1871 transitions. [2023-12-21 23:38:02,882 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:38:02,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1871 transitions. [2023-12-21 23:38:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-21 23:38:02,882 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:02,882 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:38:02,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-12-21 23:38:03,085 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:38:03,085 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:03,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:03,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1880579684, now seen corresponding path program 1 times [2023-12-21 23:38:03,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:03,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256041475] [2023-12-21 23:38:03,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:03,086 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:03,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:03,087 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:38:03,089 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:38:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:03,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-21 23:38:03,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:03,623 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:38:03,623 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:03,890 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:38:03,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:03,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256041475] [2023-12-21 23:38:03,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256041475] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:03,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:03,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-21 23:38:03,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445986405] [2023-12-21 23:38:03,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:03,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 23:38:03,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:03,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 23:38:03,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-21 23:38:03,891 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:38:04,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:04,715 INFO L93 Difference]: Finished difference Result 1627 states and 2614 transitions. [2023-12-21 23:38:04,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-21 23:38:04,716 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:38:04,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:04,719 INFO L225 Difference]: With dead ends: 1627 [2023-12-21 23:38:04,719 INFO L226 Difference]: Without dead ends: 1349 [2023-12-21 23:38:04,720 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:38:04,720 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:38:04,720 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:38:04,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2023-12-21 23:38:04,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1285. [2023-12-21 23:38:04,741 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:38:04,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 2143 transitions. [2023-12-21 23:38:04,743 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 2143 transitions. Word has length 56 [2023-12-21 23:38:04,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:04,743 INFO L495 AbstractCegarLoop]: Abstraction has 1285 states and 2143 transitions. [2023-12-21 23:38:04,743 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:38:04,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 2143 transitions. [2023-12-21 23:38:04,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-21 23:38:04,743 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:04,743 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:38:04,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-12-21 23:38:04,946 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:38:04,946 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:04,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:04,946 INFO L85 PathProgramCache]: Analyzing trace with hash 35128148, now seen corresponding path program 1 times [2023-12-21 23:38:04,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:04,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2109230922] [2023-12-21 23:38:04,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:04,947 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:04,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:04,948 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:38:04,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-21 23:38:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:05,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 23:38:05,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:05,081 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:38:05,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:05,167 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:38:05,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:05,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2109230922] [2023-12-21 23:38:05,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2109230922] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:05,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:05,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-21 23:38:05,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260294380] [2023-12-21 23:38:05,167 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:05,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 23:38:05,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:05,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 23:38:05,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 23:38:05,168 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:38:05,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:05,243 INFO L93 Difference]: Finished difference Result 2233 states and 3384 transitions. [2023-12-21 23:38:05,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:38:05,243 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:38:05,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:05,248 INFO L225 Difference]: With dead ends: 2233 [2023-12-21 23:38:05,248 INFO L226 Difference]: Without dead ends: 1747 [2023-12-21 23:38:05,250 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:38:05,251 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:38:05,251 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:38:05,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2023-12-21 23:38:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1691. [2023-12-21 23:38:05,281 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:38:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2614 transitions. [2023-12-21 23:38:05,284 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2614 transitions. Word has length 58 [2023-12-21 23:38:05,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:05,284 INFO L495 AbstractCegarLoop]: Abstraction has 1691 states and 2614 transitions. [2023-12-21 23:38:05,284 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:38:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2614 transitions. [2023-12-21 23:38:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-21 23:38:05,285 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:05,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:38:05,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 (16)] Forceful destruction successful, exit code 0 [2023-12-21 23:38:05,488 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:38:05,488 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:05,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:05,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2096123822, now seen corresponding path program 1 times [2023-12-21 23:38:05,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:05,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091380897] [2023-12-21 23:38:05,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:05,489 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:05,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:05,490 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:38:05,504 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:38:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:05,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:38:05,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:05,653 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:38:05,653 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:05,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:05,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091380897] [2023-12-21 23:38:05,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091380897] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:05,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:05,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 23:38:05,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194969799] [2023-12-21 23:38:05,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:05,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:38:05,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:05,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:38:05,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:38:05,655 INFO L87 Difference]: Start difference. First operand 1691 states and 2614 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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:37,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:37,056 INFO L93 Difference]: Finished difference Result 3195 states and 5487 transitions. [2023-12-21 23:38:37,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:38:37,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2023-12-21 23:38:37,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:37,063 INFO L225 Difference]: With dead ends: 3195 [2023-12-21 23:38:37,063 INFO L226 Difference]: Without dead ends: 2442 [2023-12-21 23:38:37,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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:37,064 INFO L413 NwaCegarLoop]: 531 mSDtfsCounter, 801 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2406 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 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:37,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [801 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:37,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2023-12-21 23:38:37,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2442. [2023-12-21 23:38:37,098 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:37,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3593 transitions. [2023-12-21 23:38:37,101 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3593 transitions. Word has length 66 [2023-12-21 23:38:37,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:37,101 INFO L495 AbstractCegarLoop]: Abstraction has 2442 states and 3593 transitions. [2023-12-21 23:38:37,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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:37,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3593 transitions. [2023-12-21 23:38:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-21 23:38:37,102 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:37,102 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:37,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-21 23:38:37,305 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:37,305 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:37,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:37,306 INFO L85 PathProgramCache]: Analyzing trace with hash 140333250, now seen corresponding path program 1 times [2023-12-21 23:38:37,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:37,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2723883] [2023-12-21 23:38:37,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:37,306 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:37,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:37,307 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:37,309 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:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:37,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-21 23:38:37,392 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:38,429 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:38,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:38,838 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:38,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:38,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2723883] [2023-12-21 23:38:38,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2723883] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:38,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:38,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-21 23:38:38,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212922344] [2023-12-21 23:38:38,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:38,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:38:38,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:38,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:38:38,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:38:38,841 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:40,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:40,399 INFO L93 Difference]: Finished difference Result 3030 states and 4348 transitions. [2023-12-21 23:38:40,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-21 23:38:40,399 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:40,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:40,408 INFO L225 Difference]: With dead ends: 3030 [2023-12-21 23:38:40,408 INFO L226 Difference]: Without dead ends: 2466 [2023-12-21 23:38:40,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=383, Invalid=1423, Unknown=0, NotChecked=0, Total=1806 [2023-12-21 23:38:40,411 INFO L413 NwaCegarLoop]: 1493 mSDtfsCounter, 14791 mSDsluCounter, 6154 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14791 SdHoareTripleChecker+Valid, 7647 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:40,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14791 Valid, 7647 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 23:38:40,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2023-12-21 23:38:40,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 2442. [2023-12-21 23:38:40,487 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:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3576 transitions. [2023-12-21 23:38:40,490 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3576 transitions. Word has length 91 [2023-12-21 23:38:40,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:40,490 INFO L495 AbstractCegarLoop]: Abstraction has 2442 states and 3576 transitions. [2023-12-21 23:38:40,490 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:40,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3576 transitions. [2023-12-21 23:38:40,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-21 23:38:40,491 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:40,491 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:40,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-21 23:38:40,694 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:40,695 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:40,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:40,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1835633798, now seen corresponding path program 1 times [2023-12-21 23:38:40,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:40,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693335525] [2023-12-21 23:38:40,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:40,696 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:40,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:40,697 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:40,698 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:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:40,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-21 23:38:40,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:41,616 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:41,616 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:42,100 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:42,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:42,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693335525] [2023-12-21 23:38:42,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693335525] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:42,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:42,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-21 23:38:42,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375427786] [2023-12-21 23:38:42,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:42,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:38:42,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:42,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:38:42,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:38:42,102 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:43,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:43,866 INFO L93 Difference]: Finished difference Result 3138 states and 4456 transitions. [2023-12-21 23:38:43,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-21 23:38:43,867 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:43,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:43,875 INFO L225 Difference]: With dead ends: 3138 [2023-12-21 23:38:43,875 INFO L226 Difference]: Without dead ends: 2444 [2023-12-21 23:38:43,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=403, Invalid=1489, Unknown=0, NotChecked=0, Total=1892 [2023-12-21 23:38:43,878 INFO L413 NwaCegarLoop]: 1493 mSDtfsCounter, 14833 mSDsluCounter, 6155 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14833 SdHoareTripleChecker+Valid, 7648 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:43,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14833 Valid, 7648 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-21 23:38:43,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2023-12-21 23:38:43,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 2442. [2023-12-21 23:38:43,924 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:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3560 transitions. [2023-12-21 23:38:43,928 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3560 transitions. Word has length 92 [2023-12-21 23:38:43,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:43,928 INFO L495 AbstractCegarLoop]: Abstraction has 2442 states and 3560 transitions. [2023-12-21 23:38:43,928 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:43,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3560 transitions. [2023-12-21 23:38:43,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-21 23:38:43,929 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:43,929 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:43,952 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:44,134 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:44,134 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:44,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:44,134 INFO L85 PathProgramCache]: Analyzing trace with hash 925523154, now seen corresponding path program 1 times [2023-12-21 23:38:44,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:44,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694172872] [2023-12-21 23:38:44,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:44,135 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:44,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:44,136 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:44,140 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:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:44,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 23:38:44,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:45,515 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:45,516 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:46,208 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:46,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:46,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694172872] [2023-12-21 23:38:46,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [694172872] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:46,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:46,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-21 23:38:46,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618352380] [2023-12-21 23:38:46,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:46,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:38:46,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:46,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:38:46,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:38:46,210 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:48,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:48,625 INFO L93 Difference]: Finished difference Result 3202 states and 4507 transitions. [2023-12-21 23:38:48,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-21 23:38:48,626 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:48,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:48,630 INFO L225 Difference]: With dead ends: 3202 [2023-12-21 23:38:48,630 INFO L226 Difference]: Without dead ends: 2824 [2023-12-21 23:38:48,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=306, Invalid=1950, Unknown=0, NotChecked=0, Total=2256 [2023-12-21 23:38:48,632 INFO L413 NwaCegarLoop]: 1518 mSDtfsCounter, 1822 mSDsluCounter, 19601 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1822 SdHoareTripleChecker+Valid, 21119 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:48,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1822 Valid, 21119 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-21 23:38:48,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2023-12-21 23:38:48,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 2326. [2023-12-21 23:38:48,680 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:48,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 3423 transitions. [2023-12-21 23:38:48,683 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 3423 transitions. Word has length 93 [2023-12-21 23:38:48,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:48,683 INFO L495 AbstractCegarLoop]: Abstraction has 2326 states and 3423 transitions. [2023-12-21 23:38:48,683 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:48,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 3423 transitions. [2023-12-21 23:38:48,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-21 23:38:48,686 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:48,686 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:48,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-21 23:38:48,890 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:48,890 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:48,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:48,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1280228726, now seen corresponding path program 1 times [2023-12-21 23:38:48,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:48,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950292590] [2023-12-21 23:38:48,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:48,891 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:48,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:48,892 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:48,922 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:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:48,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 23:38:48,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:50,035 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:50,035 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:50,555 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:50,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:50,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950292590] [2023-12-21 23:38:50,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950292590] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:50,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:50,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-21 23:38:50,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207608155] [2023-12-21 23:38:50,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:50,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:38:50,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:50,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:38:50,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:38:50,557 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:55,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:55,812 INFO L93 Difference]: Finished difference Result 2976 states and 4222 transitions. [2023-12-21 23:38:55,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-21 23:38:55,813 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:55,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:55,817 INFO L225 Difference]: With dead ends: 2976 [2023-12-21 23:38:55,817 INFO L226 Difference]: Without dead ends: 2694 [2023-12-21 23:38:55,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=863, Invalid=3967, Unknown=0, NotChecked=0, Total=4830 [2023-12-21 23:38:55,818 INFO L413 NwaCegarLoop]: 1578 mSDtfsCounter, 4864 mSDsluCounter, 20093 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4864 SdHoareTripleChecker+Valid, 21671 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:55,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4864 Valid, 21671 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-21 23:38:55,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2023-12-21 23:38:55,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2494. [2023-12-21 23:38:55,871 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:55,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2494 states and 3620 transitions. [2023-12-21 23:38:55,874 INFO L78 Accepts]: Start accepts. Automaton has 2494 states and 3620 transitions. Word has length 93 [2023-12-21 23:38:55,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:55,874 INFO L495 AbstractCegarLoop]: Abstraction has 2494 states and 3620 transitions. [2023-12-21 23:38:55,874 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:55,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 3620 transitions. [2023-12-21 23:38:55,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-21 23:38:55,875 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:55,875 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:55,896 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:56,078 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:56,078 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:56,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:56,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1228856494, now seen corresponding path program 1 times [2023-12-21 23:38:56,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:56,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746616140] [2023-12-21 23:38:56,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:56,079 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:56,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:56,085 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:56,085 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:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:56,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 23:38:56,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:57,157 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:57,157 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:57,624 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:57,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:57,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746616140] [2023-12-21 23:38:57,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746616140] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:57,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:57,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-21 23:38:57,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862129815] [2023-12-21 23:38:57,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:57,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:38:57,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:57,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:38:57,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:38:57,627 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:39:04,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:39:04,285 INFO L93 Difference]: Finished difference Result 4138 states and 5597 transitions. [2023-12-21 23:39:04,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-12-21 23:39:04,285 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:39:04,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:39:04,291 INFO L225 Difference]: With dead ends: 4138 [2023-12-21 23:39:04,291 INFO L226 Difference]: Without dead ends: 3838 [2023-12-21 23:39:04,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1011, Invalid=4995, Unknown=0, NotChecked=0, Total=6006 [2023-12-21 23:39:04,293 INFO L413 NwaCegarLoop]: 1594 mSDtfsCounter, 3565 mSDsluCounter, 23516 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3565 SdHoareTripleChecker+Valid, 25110 SdHoareTripleChecker+Invalid, 2256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-21 23:39:04,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3565 Valid, 25110 Invalid, 2256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2234 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-21 23:39:04,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3838 states. [2023-12-21 23:39:04,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3838 to 3197. [2023-12-21 23:39:04,412 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:39:04,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3197 states to 3197 states and 4461 transitions. [2023-12-21 23:39:04,416 INFO L78 Accepts]: Start accepts. Automaton has 3197 states and 4461 transitions. Word has length 93 [2023-12-21 23:39:04,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:39:04,416 INFO L495 AbstractCegarLoop]: Abstraction has 3197 states and 4461 transitions. [2023-12-21 23:39:04,416 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:39:04,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3197 states and 4461 transitions. [2023-12-21 23:39:04,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 23:39:04,418 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:39:04,418 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:04,424 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:39:04,619 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:39:04,619 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:39:04,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:39:04,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1805743268, now seen corresponding path program 2 times [2023-12-21 23:39:04,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:39:04,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360604318] [2023-12-21 23:39:04,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 23:39:04,620 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:04,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:39:04,621 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:39:04,622 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:39:04,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 23:39:04,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 23:39:04,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:39:04,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:39:05,175 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:05,175 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:39:05,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:39:05,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360604318] [2023-12-21 23:39:05,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360604318] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:39:05,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:39:05,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 23:39:05,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569075303] [2023-12-21 23:39:05,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:39:05,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 23:39:05,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:39:05,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 23:39:05,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:39:05,177 INFO L87 Difference]: Start difference. First operand 3197 states and 4461 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:05,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:39:05,326 INFO L93 Difference]: Finished difference Result 3979 states and 5450 transitions. [2023-12-21 23:39:05,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:39:05,327 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:05,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:39:05,344 INFO L225 Difference]: With dead ends: 3979 [2023-12-21 23:39:05,345 INFO L226 Difference]: Without dead ends: 3325 [2023-12-21 23:39:05,351 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:05,352 INFO L413 NwaCegarLoop]: 1531 mSDtfsCounter, 2976 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2976 SdHoareTripleChecker+Valid, 3086 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:39:05,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2976 Valid, 3086 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 23:39:05,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3325 states. [2023-12-21 23:39:05,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3325 to 3189. [2023-12-21 23:39:05,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3189 states, 3187 states have (on average 1.3871979918418575) internal successors, (4421), 3188 states have internal predecessors, (4421), 0 states have call successors, (0), 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:05,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4421 transitions. [2023-12-21 23:39:05,460 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4421 transitions. Word has length 130 [2023-12-21 23:39:05,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:39:05,460 INFO L495 AbstractCegarLoop]: Abstraction has 3189 states and 4421 transitions. [2023-12-21 23:39:05,460 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:05,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4421 transitions. [2023-12-21 23:39:05,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 23:39:05,462 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:39:05,462 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:05,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-21 23:39:05,665 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:05,665 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:39:05,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:39:05,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1451037696, now seen corresponding path program 2 times [2023-12-21 23:39:05,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:39:05,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610496968] [2023-12-21 23:39:05,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 23:39:05,667 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:05,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:39:05,681 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:05,725 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:05,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 23:39:05,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 23:39:05,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:39:05,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:39:06,303 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:06,303 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:39:06,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:39:06,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610496968] [2023-12-21 23:39:06,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610496968] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:39:06,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:39:06,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 23:39:06,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55073982] [2023-12-21 23:39:06,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:39:06,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 23:39:06,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:39:06,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 23:39:06,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:39:06,304 INFO L87 Difference]: Start difference. First operand 3189 states and 4421 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:06,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:39:06,464 INFO L93 Difference]: Finished difference Result 3758 states and 5157 transitions. [2023-12-21 23:39:06,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:39:06,465 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:06,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:39:06,469 INFO L225 Difference]: With dead ends: 3758 [2023-12-21 23:39:06,469 INFO L226 Difference]: Without dead ends: 3429 [2023-12-21 23:39:06,470 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:06,470 INFO L413 NwaCegarLoop]: 1534 mSDtfsCounter, 1521 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 3132 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:39:06,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 3132 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 23:39:06,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3429 states. [2023-12-21 23:39:06,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3429 to 3361. [2023-12-21 23:39:06,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3361 states, 3359 states have (on average 1.373027686811551) internal successors, (4612), 3360 states have internal predecessors, (4612), 0 states have call successors, (0), 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:06,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3361 states to 3361 states and 4612 transitions. [2023-12-21 23:39:06,562 INFO L78 Accepts]: Start accepts. Automaton has 3361 states and 4612 transitions. Word has length 130 [2023-12-21 23:39:06,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:39:06,562 INFO L495 AbstractCegarLoop]: Abstraction has 3361 states and 4612 transitions. [2023-12-21 23:39:06,562 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:06,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3361 states and 4612 transitions. [2023-12-21 23:39:06,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 23:39:06,564 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:39:06,564 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:06,567 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:06,766 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:06,767 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:39:06,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:39:06,767 INFO L85 PathProgramCache]: Analyzing trace with hash 334844380, now seen corresponding path program 2 times [2023-12-21 23:39:06,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:39:06,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2046178712] [2023-12-21 23:39:06,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 23:39:06,768 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:06,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:39:06,769 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:06,795 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:06,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 23:39:06,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 23:39:06,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:39:06,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:39:07,377 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:07,377 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:39:07,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:39:07,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2046178712] [2023-12-21 23:39:07,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2046178712] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:39:07,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:39:07,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 23:39:07,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469251786] [2023-12-21 23:39:07,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:39:07,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 23:39:07,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:39:07,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 23:39:07,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:39:07,379 INFO L87 Difference]: Start difference. First operand 3361 states and 4612 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:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:39:07,535 INFO L93 Difference]: Finished difference Result 3885 states and 5288 transitions. [2023-12-21 23:39:07,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:39:07,535 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:07,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:39:07,556 INFO L225 Difference]: With dead ends: 3885 [2023-12-21 23:39:07,556 INFO L226 Difference]: Without dead ends: 3611 [2023-12-21 23:39:07,557 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:07,565 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:07,565 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:07,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3611 states. [2023-12-21 23:39:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3611 to 3543. [2023-12-21 23:39:07,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3543 states, 3541 states have (on average 1.3617622140638237) internal successors, (4822), 3542 states have internal predecessors, (4822), 0 states have call successors, (0), 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:07,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3543 states to 3543 states and 4822 transitions. [2023-12-21 23:39:07,683 INFO L78 Accepts]: Start accepts. Automaton has 3543 states and 4822 transitions. Word has length 130 [2023-12-21 23:39:07,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:39:07,683 INFO L495 AbstractCegarLoop]: Abstraction has 3543 states and 4822 transitions. [2023-12-21 23:39:07,683 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:07,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3543 states and 4822 transitions. [2023-12-21 23:39:07,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-21 23:39:07,685 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:39:07,685 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:07,701 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:07,888 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:07,889 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:39:07,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:39:07,889 INFO L85 PathProgramCache]: Analyzing trace with hash -748476014, now seen corresponding path program 1 times [2023-12-21 23:39:07,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:39:07,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272194245] [2023-12-21 23:39:07,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:39:07,890 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:07,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:39:07,891 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:07,892 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:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:39:07,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 23:39:07,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:39:09,168 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:09,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:39:10,201 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:10,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:39:10,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272194245] [2023-12-21 23:39:10,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272194245] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:39:10,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:39:10,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-21 23:39:10,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460818412] [2023-12-21 23:39:10,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:39:10,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 23:39:10,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:39:10,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 23:39:10,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1006, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 23:39:10,205 INFO L87 Difference]: Start difference. First operand 3543 states and 4822 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:39:44,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:39:44,494 INFO L93 Difference]: Finished difference Result 13070 states and 16296 transitions. [2023-12-21 23:39:44,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 262 states. [2023-12-21 23:39:44,494 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:39:44,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:39:44,505 INFO L225 Difference]: With dead ends: 13070 [2023-12-21 23:39:44,505 INFO L226 Difference]: Without dead ends: 12478 [2023-12-21 23:39:44,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33525 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=8390, Invalid=76000, Unknown=0, NotChecked=0, Total=84390 [2023-12-21 23:39:44,516 INFO L413 NwaCegarLoop]: 1680 mSDtfsCounter, 26157 mSDsluCounter, 16785 mSDsCounter, 0 mSdLazyCounter, 3950 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26157 SdHoareTripleChecker+Valid, 18465 SdHoareTripleChecker+Invalid, 4042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 3950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:39:44,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26157 Valid, 18465 Invalid, 4042 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [92 Valid, 3950 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2023-12-21 23:39:44,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12478 states. [2023-12-21 23:39:44,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12478 to 11674. [2023-12-21 23:39:44,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11674 states, 11672 states have (on average 1.2458019191226868) internal successors, (14541), 11673 states have internal predecessors, (14541), 0 states have call successors, (0), 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:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11674 states to 11674 states and 14541 transitions. [2023-12-21 23:39:45,002 INFO L78 Accepts]: Start accepts. Automaton has 11674 states and 14541 transitions. Word has length 131 [2023-12-21 23:39:45,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:39:45,002 INFO L495 AbstractCegarLoop]: Abstraction has 11674 states and 14541 transitions. [2023-12-21 23:39:45,003 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:39:45,003 INFO L276 IsEmpty]: Start isEmpty. Operand 11674 states and 14541 transitions. [2023-12-21 23:39:45,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-21 23:39:45,007 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:39:45,008 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:45,012 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:45,211 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:45,211 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:39:45,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:39:45,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1220706506, now seen corresponding path program 1 times [2023-12-21 23:39:45,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:39:45,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895558299] [2023-12-21 23:39:45,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:39:45,212 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:45,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:39:45,213 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:45,215 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:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:39:45,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-21 23:39:45,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:39:47,237 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:39:47,238 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:39:49,346 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:39:49,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:39:49,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895558299] [2023-12-21 23:39:49,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1895558299] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:39:49,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:39:49,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 39 [2023-12-21 23:39:49,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111159651] [2023-12-21 23:39:49,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:39:49,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-21 23:39:49,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:39:49,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-21 23:39:49,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1318, Unknown=0, NotChecked=0, Total=1482 [2023-12-21 23:39:49,355 INFO L87 Difference]: Start difference. First operand 11674 states and 14541 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:29,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:40:29,672 INFO L93 Difference]: Finished difference Result 21489 states and 26273 transitions. [2023-12-21 23:40:29,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2023-12-21 23:40:29,674 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:29,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:40:29,686 INFO L225 Difference]: With dead ends: 21489 [2023-12-21 23:40:29,686 INFO L226 Difference]: Without dead ends: 16224 [2023-12-21 23:40:29,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12543 ImplicationChecksByTransitivity, 36.0s TimeCoverageRelationStatistics Valid=4990, Invalid=30166, Unknown=0, NotChecked=0, Total=35156 [2023-12-21 23:40:29,691 INFO L413 NwaCegarLoop]: 1543 mSDtfsCounter, 20940 mSDsluCounter, 16023 mSDsCounter, 0 mSdLazyCounter, 2100 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20940 SdHoareTripleChecker+Valid, 17566 SdHoareTripleChecker+Invalid, 2241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 2100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-12-21 23:40:29,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20940 Valid, 17566 Invalid, 2241 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [141 Valid, 2100 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2023-12-21 23:40:29,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16224 states. [2023-12-21 23:40:30,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16224 to 14007. [2023-12-21 23:40:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14007 states, 14005 states have (on average 1.2329168154230632) internal successors, (17267), 14006 states have internal predecessors, (17267), 0 states have call successors, (0), 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:30,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14007 states to 14007 states and 17267 transitions. [2023-12-21 23:40:30,326 INFO L78 Accepts]: Start accepts. Automaton has 14007 states and 17267 transitions. Word has length 131 [2023-12-21 23:40:30,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:40:30,326 INFO L495 AbstractCegarLoop]: Abstraction has 14007 states and 17267 transitions. [2023-12-21 23:40:30,327 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:30,327 INFO L276 IsEmpty]: Start isEmpty. Operand 14007 states and 17267 transitions. [2023-12-21 23:40:30,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-21 23:40:30,331 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:40:30,331 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:30,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-12-21 23:40:30,535 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:30,535 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:40:30,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:40:30,535 INFO L85 PathProgramCache]: Analyzing trace with hash 102814406, now seen corresponding path program 1 times [2023-12-21 23:40:30,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:40:30,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32622756] [2023-12-21 23:40:30,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:40:30,536 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:30,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:40:30,537 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:30,538 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:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:40:30,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-21 23:40:30,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:40:32,502 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:32,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:40:33,957 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:33,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:40:33,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32622756] [2023-12-21 23:40:33,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32622756] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:40:33,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:40:33,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-21 23:40:33,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045503749] [2023-12-21 23:40:33,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:40:33,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 23:40:33,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:40:33,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 23:40:33,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 23:40:33,959 INFO L87 Difference]: Start difference. First operand 14007 states and 17267 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:02,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:41:02,431 INFO L93 Difference]: Finished difference Result 23005 states and 27988 transitions. [2023-12-21 23:41:02,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2023-12-21 23:41:02,432 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:02,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:41:02,446 INFO L225 Difference]: With dead ends: 23005 [2023-12-21 23:41:02,446 INFO L226 Difference]: Without dead ends: 16137 [2023-12-21 23:41:02,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7206 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=3210, Invalid=17382, Unknown=0, NotChecked=0, Total=20592 [2023-12-21 23:41:02,452 INFO L413 NwaCegarLoop]: 1535 mSDtfsCounter, 17155 mSDsluCounter, 19117 mSDsCounter, 0 mSdLazyCounter, 2042 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17155 SdHoareTripleChecker+Valid, 20652 SdHoareTripleChecker+Invalid, 2131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 2042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-12-21 23:41:02,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17155 Valid, 20652 Invalid, 2131 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [89 Valid, 2042 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-12-21 23:41:02,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16137 states. [2023-12-21 23:41:03,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16137 to 14912. [2023-12-21 23:41:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14912 states, 14910 states have (on average 1.2268947015425888) internal successors, (18293), 14911 states have internal predecessors, (18293), 0 states have call successors, (0), 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:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14912 states to 14912 states and 18293 transitions. [2023-12-21 23:41:03,131 INFO L78 Accepts]: Start accepts. Automaton has 14912 states and 18293 transitions. Word has length 132 [2023-12-21 23:41:03,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:41:03,131 INFO L495 AbstractCegarLoop]: Abstraction has 14912 states and 18293 transitions. [2023-12-21 23:41:03,132 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:03,132 INFO L276 IsEmpty]: Start isEmpty. Operand 14912 states and 18293 transitions. [2023-12-21 23:41:03,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-21 23:41:03,136 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:41:03,136 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:03,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-12-21 23:41:03,340 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:41:03,340 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:41:03,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:41:03,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1855635418, now seen corresponding path program 1 times [2023-12-21 23:41:03,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:41:03,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469081825] [2023-12-21 23:41:03,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:41:03,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:41:03,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:41:03,342 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:41:03,397 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:41:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:41:03,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-21 23:41:03,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:41:05,269 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:05,270 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:41:07,187 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:07,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:41:07,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469081825] [2023-12-21 23:41:07,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469081825] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:41:07,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:41:07,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-21 23:41:07,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59318282] [2023-12-21 23:41:07,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:41:07,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 23:41:07,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:41:07,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 23:41:07,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=989, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 23:41:07,189 INFO L87 Difference]: Start difference. First operand 14912 states and 18293 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:40,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:41:40,462 INFO L93 Difference]: Finished difference Result 28881 states and 35001 transitions. [2023-12-21 23:41:40,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2023-12-21 23:41:40,464 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:40,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:41:40,485 INFO L225 Difference]: With dead ends: 28881 [2023-12-21 23:41:40,485 INFO L226 Difference]: Without dead ends: 22492 [2023-12-21 23:41:40,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10750 ImplicationChecksByTransitivity, 29.1s TimeCoverageRelationStatistics Valid=4570, Invalid=24842, Unknown=0, NotChecked=0, Total=29412 [2023-12-21 23:41:40,492 INFO L413 NwaCegarLoop]: 1571 mSDtfsCounter, 26740 mSDsluCounter, 14873 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26740 SdHoareTripleChecker+Valid, 16444 SdHoareTripleChecker+Invalid, 1886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-21 23:41:40,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26740 Valid, 16444 Invalid, 1886 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [130 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-12-21 23:41:40,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22492 states. [2023-12-21 23:41:41,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22492 to 16419. [2023-12-21 23:41:41,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16419 states, 16417 states have (on average 1.225193397088384) internal successors, (20114), 16418 states have internal predecessors, (20114), 0 states have call successors, (0), 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:41,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16419 states to 16419 states and 20114 transitions. [2023-12-21 23:41:41,365 INFO L78 Accepts]: Start accepts. Automaton has 16419 states and 20114 transitions. Word has length 132 [2023-12-21 23:41:41,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:41:41,365 INFO L495 AbstractCegarLoop]: Abstraction has 16419 states and 20114 transitions. [2023-12-21 23:41:41,365 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:41,365 INFO L276 IsEmpty]: Start isEmpty. Operand 16419 states and 20114 transitions. [2023-12-21 23:41:41,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-21 23:41:41,369 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:41:41,369 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:41,388 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:41,573 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:41,573 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:41:41,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:41:41,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1411981366, now seen corresponding path program 1 times [2023-12-21 23:41:41,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:41:41,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093821961] [2023-12-21 23:41:41,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:41:41,574 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:41,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:41:41,575 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:41,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-12-21 23:41:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:41:41,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-21 23:41:41,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:41:43,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:43,984 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:41:45,940 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:41:45,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:41:45,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093821961] [2023-12-21 23:41:45,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093821961] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:41:45,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:41:45,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 36 [2023-12-21 23:41:45,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841070359] [2023-12-21 23:41:45,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:41:45,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-21 23:41:45,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:41:45,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-21 23:41:45,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2023-12-21 23:41:45,942 INFO L87 Difference]: Start difference. First operand 16419 states and 20114 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:10,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:42:10,222 INFO L93 Difference]: Finished difference Result 33999 states and 41226 transitions. [2023-12-21 23:42:10,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2023-12-21 23:42:10,224 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:10,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:42:10,244 INFO L225 Difference]: With dead ends: 33999 [2023-12-21 23:42:10,244 INFO L226 Difference]: Without dead ends: 21717 [2023-12-21 23:42:10,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7109 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=4005, Invalid=16875, Unknown=0, NotChecked=0, Total=20880 [2023-12-21 23:42:10,256 INFO L413 NwaCegarLoop]: 1542 mSDtfsCounter, 18180 mSDsluCounter, 15805 mSDsCounter, 0 mSdLazyCounter, 2080 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18180 SdHoareTripleChecker+Valid, 17347 SdHoareTripleChecker+Invalid, 2151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:42:10,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18180 Valid, 17347 Invalid, 2151 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [71 Valid, 2080 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-12-21 23:42:10,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21717 states. [2023-12-21 23:42:11,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21717 to 19494. [2023-12-21 23:42:11,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19494 states, 19492 states have (on average 1.2222450235994253) internal successors, (23824), 19493 states have internal predecessors, (23824), 0 states have call successors, (0), 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:11,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19494 states to 19494 states and 23824 transitions. [2023-12-21 23:42:11,378 INFO L78 Accepts]: Start accepts. Automaton has 19494 states and 23824 transitions. Word has length 133 [2023-12-21 23:42:11,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:42:11,378 INFO L495 AbstractCegarLoop]: Abstraction has 19494 states and 23824 transitions. [2023-12-21 23:42:11,378 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:11,378 INFO L276 IsEmpty]: Start isEmpty. Operand 19494 states and 23824 transitions. [2023-12-21 23:42:11,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-21 23:42:11,381 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:42:11,381 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:11,387 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:42:11,587 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:42:11,587 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:42:11,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:42:11,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1160518112, now seen corresponding path program 1 times [2023-12-21 23:42:11,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:42:11,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212637377] [2023-12-21 23:42:11,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:42:11,588 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:11,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:42:11,589 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:42:11,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-21 23:42:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:42:11,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 23:42:11,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:42:11,857 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:11,858 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:42:12,087 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:12,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:42:12,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212637377] [2023-12-21 23:42:12,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212637377] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:42:12,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:42:12,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-21 23:42:12,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690317760] [2023-12-21 23:42:12,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:42:12,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 23:42:12,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:42:12,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 23:42:12,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-21 23:42:12,089 INFO L87 Difference]: Start difference. First operand 19494 states and 23824 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:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:42:15,505 INFO L93 Difference]: Finished difference Result 77557 states and 94432 transitions. [2023-12-21 23:42:15,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 23:42:15,505 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:15,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:42:15,568 INFO L225 Difference]: With dead ends: 77557 [2023-12-21 23:42:15,568 INFO L226 Difference]: Without dead ends: 60200 [2023-12-21 23:42:15,580 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:15,580 INFO L413 NwaCegarLoop]: 1560 mSDtfsCounter, 1680 mSDsluCounter, 9306 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1680 SdHoareTripleChecker+Valid, 10866 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:42:15,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1680 Valid, 10866 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 23:42:15,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60200 states. [2023-12-21 23:42:19,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60200 to 59195. [2023-12-21 23:42:19,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59195 states, 59193 states have (on average 1.1571131721656276) internal successors, (68493), 59194 states have internal predecessors, (68493), 0 states have call successors, (0), 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:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59195 states to 59195 states and 68493 transitions. [2023-12-21 23:42:19,110 INFO L78 Accepts]: Start accepts. Automaton has 59195 states and 68493 transitions. Word has length 134 [2023-12-21 23:42:19,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:42:19,110 INFO L495 AbstractCegarLoop]: Abstraction has 59195 states and 68493 transitions. [2023-12-21 23:42:19,111 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:19,111 INFO L276 IsEmpty]: Start isEmpty. Operand 59195 states and 68493 transitions. [2023-12-21 23:42:19,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-21 23:42:19,113 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:42:19,113 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:19,116 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:19,316 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:19,316 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:42:19,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:42:19,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1048126494, now seen corresponding path program 1 times [2023-12-21 23:42:19,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:42:19,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815126194] [2023-12-21 23:42:19,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:42:19,317 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:19,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:42:19,318 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:19,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-12-21 23:42:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 23:42:19,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 23:42:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 23:42:19,603 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-21 23:42:19,603 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 23:42:19,604 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-21 23:42:19,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-21 23:42:19,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-12-21 23:42:19,809 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:19,811 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] [2023-12-21 23:42:19,814 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 23:42:19,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 11:42:19 BoogieIcfgContainer [2023-12-21 23:42:19,943 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 23:42:19,943 INFO L158 Benchmark]: Toolchain (without parser) took 291718.36ms. Allocated memory was 306.2MB in the beginning and 2.8GB in the end (delta: 2.5GB). Free memory was 236.5MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 457.5MB. Max. memory is 8.0GB. [2023-12-21 23:42:19,943 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 202.4MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 23:42:19,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1347.52ms. Allocated memory is still 306.2MB. Free memory was 236.5MB in the beginning and 188.7MB in the end (delta: 47.8MB). Peak memory consumption was 168.9MB. Max. memory is 8.0GB. [2023-12-21 23:42:19,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 169.03ms. Allocated memory is still 306.2MB. Free memory was 188.7MB in the beginning and 153.6MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2023-12-21 23:42:19,943 INFO L158 Benchmark]: Boogie Preprocessor took 279.37ms. Allocated memory is still 306.2MB. Free memory was 153.6MB in the beginning and 114.8MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2023-12-21 23:42:19,944 INFO L158 Benchmark]: RCFGBuilder took 23880.80ms. Allocated memory was 306.2MB in the beginning and 608.2MB in the end (delta: 302.0MB). Free memory was 114.8MB in the beginning and 425.5MB in the end (delta: -310.7MB). Peak memory consumption was 122.8MB. Max. memory is 8.0GB. [2023-12-21 23:42:19,944 INFO L158 Benchmark]: TraceAbstraction took 266035.52ms. Allocated memory was 608.2MB in the beginning and 2.8GB in the end (delta: 2.2GB). Free memory was 424.5MB in the beginning and 2.3GB in the end (delta: -1.9GB). Peak memory consumption was 341.8MB. Max. memory is 8.0GB. [2023-12-21 23:42:19,944 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 202.4MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1347.52ms. Allocated memory is still 306.2MB. Free memory was 236.5MB in the beginning and 188.7MB in the end (delta: 47.8MB). Peak memory consumption was 168.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 169.03ms. Allocated memory is still 306.2MB. Free memory was 188.7MB in the beginning and 153.6MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 279.37ms. Allocated memory is still 306.2MB. Free memory was 153.6MB in the beginning and 114.8MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * RCFGBuilder took 23880.80ms. Allocated memory was 306.2MB in the beginning and 608.2MB in the end (delta: 302.0MB). Free memory was 114.8MB in the beginning and 425.5MB in the end (delta: -310.7MB). Peak memory consumption was 122.8MB. Max. memory is 8.0GB. * TraceAbstraction took 266035.52ms. Allocated memory was 608.2MB in the beginning and 2.8GB in the end (delta: 2.2GB). Free memory was 424.5MB in the beginning and 2.3GB in the end (delta: -1.9GB). Peak memory consumption was 341.8MB. 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: 508]: 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: 265.9s, OverallIterations: 31, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 217.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 183536 SdHoareTripleChecker+Valid, 66.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183536 mSDsluCounter, 265236 SdHoareTripleChecker+Invalid, 57.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 220313 mSDsCounter, 1162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22297 IncrementalHoareTripleChecker+Invalid, 23459 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1162 mSolverCounterUnsat, 44923 mSDtfsCounter, 22297 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4713 GetRequests, 3394 SyntacticMatches, 1 SemanticMatches, 1318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74950 ImplicationChecksByTransitivity, 152.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59195occurred in iteration=30, InterpolantAutomatonStates: 1088, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.5s AutomataMinimizationTime, 30 MinimizatonAttempts, 15807 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 30.6s InterpolantComputationTime, 2462 NumberOfCodeBlocks, 2198 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 3755 ConstructedInterpolants, 807 QuantifiedInterpolants, 47094 SizeOfPredicates, 136 NumberOfNonLiveVariables, 5148 ConjunctsInSsa, 259 ConjunctsInUnsatCore, 45 InterpolantComputations, 15 PerfectInterpolantSequences, 2331/4211 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:20,050 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...