/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_label02.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 23:36:39,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 23:36:39,217 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:36:39,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 23:36:39,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 23:36:39,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 23:36:39,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 23:36:39,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 23:36:39,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 23:36:39,252 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 23:36:39,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 23:36:39,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 23:36:39,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 23:36:39,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 23:36:39,255 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 23:36:39,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 23:36:39,255 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 23:36:39,255 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 23:36:39,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 23:36:39,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 23:36:39,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 23:36:39,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 23:36:39,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 23:36:39,257 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 23:36:39,257 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 23:36:39,257 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 23:36:39,257 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 23:36:39,258 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 23:36:39,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 23:36:39,258 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 23:36:39,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 23:36:39,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 23:36:39,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 23:36:39,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 23:36:39,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 23:36:39,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 23:36:39,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 23:36:39,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 23:36:39,259 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 23:36:39,259 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 23:36:39,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 23:36:39,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 23:36:39,260 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 23:36:39,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 23:36:39,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 23:36:39,260 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 23:36:39,260 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:36:39,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 23:36:39,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 23:36:39,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 23:36:39,472 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 23:36:39,474 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 23:36:39,475 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_label02.c [2023-12-21 23:36:40,573 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 23:36:40,921 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 23:36:40,921 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label02.c [2023-12-21 23:36:40,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c464b1dc/c750fce2af22472c813a9fbdc3e3da80/FLAG20c934c74 [2023-12-21 23:36:40,959 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c464b1dc/c750fce2af22472c813a9fbdc3e3da80 [2023-12-21 23:36:40,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 23:36:40,962 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 23:36:40,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 23:36:40,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 23:36:40,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 23:36:40,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:36:40" (1/1) ... [2023-12-21 23:36:40,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce24319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:36:40, skipping insertion in model container [2023-12-21 23:36:40,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:36:40" (1/1) ... [2023-12-21 23:36:41,053 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 23:36:41,335 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_label02.c[6391,6404] [2023-12-21 23:36:41,385 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_label02.c[13681,13694] [2023-12-21 23:36:41,924 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 23:36:41,944 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 23:36:41,975 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_label02.c[6391,6404] [2023-12-21 23:36:41,989 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_label02.c[13681,13694] [2023-12-21 23:36:42,290 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 23:36:42,307 INFO L206 MainTranslator]: Completed translation [2023-12-21 23:36:42,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:36:42 WrapperNode [2023-12-21 23:36:42,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 23:36:42,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 23:36:42,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 23:36:42,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 23:36:42,312 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:36:42" (1/1) ... [2023-12-21 23:36:42,343 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:36:42" (1/1) ... [2023-12-21 23:36:42,430 INFO L138 Inliner]: procedures = 34, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4962 [2023-12-21 23:36:42,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 23:36:42,431 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 23:36:42,431 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 23:36:42,431 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 23:36:42,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:36:42" (1/1) ... [2023-12-21 23:36:42,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:36:42" (1/1) ... [2023-12-21 23:36:42,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:36:42" (1/1) ... [2023-12-21 23:36:42,523 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:36:42,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:36:42" (1/1) ... [2023-12-21 23:36:42,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:36:42" (1/1) ... [2023-12-21 23:36:42,582 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:36:42" (1/1) ... [2023-12-21 23:36:42,607 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:36:42" (1/1) ... [2023-12-21 23:36:42,630 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:36:42" (1/1) ... [2023-12-21 23:36:42,653 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:36:42" (1/1) ... [2023-12-21 23:36:42,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 23:36:42,679 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 23:36:42,679 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 23:36:42,679 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 23:36:42,679 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:36:42" (1/1) ... [2023-12-21 23:36:42,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 23:36:42,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 23:36:42,699 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:36:42,737 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:36:42,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 23:36:42,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 23:36:42,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 23:36:42,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 23:36:42,917 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 23:36:42,918 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 23:37:06,966 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 23:37:07,000 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 23:37:07,000 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-21 23:37:07,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:37:07 BoogieIcfgContainer [2023-12-21 23:37:07,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 23:37:07,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 23:37:07,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 23:37:07,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 23:37:07,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 11:36:40" (1/3) ... [2023-12-21 23:37:07,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20162f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:37:07, skipping insertion in model container [2023-12-21 23:37:07,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:36:42" (2/3) ... [2023-12-21 23:37:07,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20162f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:37:07, skipping insertion in model container [2023-12-21 23:37:07,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:37:07" (3/3) ... [2023-12-21 23:37:07,006 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label02.c [2023-12-21 23:37:07,017 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 23:37:07,017 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-21 23:37:07,059 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 23:37:07,063 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;@1dba044a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 23:37:07,063 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-21 23:37:07,069 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:07,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 23:37:07,074 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:07,074 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:07,075 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:07,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:07,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1100216757, now seen corresponding path program 1 times [2023-12-21 23:37:07,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:07,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278277556] [2023-12-21 23:37:07,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:07,091 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:07,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:07,105 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:07,125 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:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:07,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 23:37:07,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:07,213 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:07,213 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:07,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:07,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278277556] [2023-12-21 23:37:07,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278277556] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:07,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:07,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 23:37:07,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859485661] [2023-12-21 23:37:07,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:07,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 23:37:07,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:07,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 23:37:07,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 23:37:07,250 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:07,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:07,338 INFO L93 Difference]: Finished difference Result 1594 states and 3146 transitions. [2023-12-21 23:37:07,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 23:37:07,354 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:07,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:07,410 INFO L225 Difference]: With dead ends: 1594 [2023-12-21 23:37:07,410 INFO L226 Difference]: Without dead ends: 803 [2023-12-21 23:37:07,416 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:07,418 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:07,419 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:07,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2023-12-21 23:37:07,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2023-12-21 23:37:07,508 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:07,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1521 transitions. [2023-12-21 23:37:07,513 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1521 transitions. Word has length 17 [2023-12-21 23:37:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:07,514 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1521 transitions. [2023-12-21 23:37:07,514 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:07,514 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1521 transitions. [2023-12-21 23:37:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 23:37:07,514 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:07,515 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:07,519 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:07,717 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:07,718 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:07,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:07,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1687022771, now seen corresponding path program 1 times [2023-12-21 23:37:07,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:07,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3679824] [2023-12-21 23:37:07,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:07,721 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:07,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:07,722 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:07,724 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:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:07,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:37:07,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:07,833 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:07,833 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:07,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:07,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3679824] [2023-12-21 23:37:07,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3679824] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:07,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:07,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 23:37:07,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709137835] [2023-12-21 23:37:07,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:07,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 23:37:07,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:07,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 23:37:07,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 23:37:07,840 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:07,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:07,917 INFO L93 Difference]: Finished difference Result 864 states and 1616 transitions. [2023-12-21 23:37:07,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 23:37:07,918 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:07,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:07,922 INFO L225 Difference]: With dead ends: 864 [2023-12-21 23:37:07,923 INFO L226 Difference]: Without dead ends: 832 [2023-12-21 23:37:07,923 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:07,924 INFO L413 NwaCegarLoop]: 1516 mSDtfsCounter, 45 mSDsluCounter, 3011 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4527 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:07,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4527 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:37:07,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2023-12-21 23:37:07,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 803. [2023-12-21 23:37:07,946 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:07,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1505 transitions. [2023-12-21 23:37:07,948 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1505 transitions. Word has length 17 [2023-12-21 23:37:07,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:07,948 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1505 transitions. [2023-12-21 23:37:07,949 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:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1505 transitions. [2023-12-21 23:37:07,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-21 23:37:07,950 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:07,951 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:07,968 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:08,153 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:08,154 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:08,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:08,155 INFO L85 PathProgramCache]: Analyzing trace with hash 613121839, now seen corresponding path program 1 times [2023-12-21 23:37:08,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:08,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833181434] [2023-12-21 23:37:08,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:08,156 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:08,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:08,157 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:08,183 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:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:08,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:37:08,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:08,441 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:08,441 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:08,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:08,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833181434] [2023-12-21 23:37:08,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833181434] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:08,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:08,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 23:37:08,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550530524] [2023-12-21 23:37:08,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:08,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 23:37:08,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:08,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 23:37:08,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:37:08,443 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:08,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:08,540 INFO L93 Difference]: Finished difference Result 919 states and 1689 transitions. [2023-12-21 23:37:08,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:37:08,541 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:08,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:08,544 INFO L225 Difference]: With dead ends: 919 [2023-12-21 23:37:08,544 INFO L226 Difference]: Without dead ends: 890 [2023-12-21 23:37:08,544 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:08,546 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:08,546 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:08,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2023-12-21 23:37:08,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 857. [2023-12-21 23:37:08,558 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:08,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1592 transitions. [2023-12-21 23:37:08,560 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1592 transitions. Word has length 32 [2023-12-21 23:37:08,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:08,560 INFO L495 AbstractCegarLoop]: Abstraction has 857 states and 1592 transitions. [2023-12-21 23:37:08,560 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:08,561 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1592 transitions. [2023-12-21 23:37:08,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 23:37:08,561 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:08,561 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:08,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-21 23:37:08,767 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:08,768 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:08,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:08,768 INFO L85 PathProgramCache]: Analyzing trace with hash 675954815, now seen corresponding path program 1 times [2023-12-21 23:37:08,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:08,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025034776] [2023-12-21 23:37:08,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:08,769 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:08,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:08,770 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:08,771 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:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:08,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:08,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:08,864 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:08,864 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:08,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:08,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025034776] [2023-12-21 23:37:08,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1025034776] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:08,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:08,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:37:08,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588268208] [2023-12-21 23:37:08,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:08,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:08,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:08,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:08,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:08,869 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:08,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:08,900 INFO L93 Difference]: Finished difference Result 1007 states and 1830 transitions. [2023-12-21 23:37:08,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:37:08,901 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:08,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:08,904 INFO L225 Difference]: With dead ends: 1007 [2023-12-21 23:37:08,904 INFO L226 Difference]: Without dead ends: 924 [2023-12-21 23:37:08,905 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:08,906 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:08,907 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:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2023-12-21 23:37:08,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 922. [2023-12-21 23:37:08,920 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:08,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1691 transitions. [2023-12-21 23:37:08,922 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1691 transitions. Word has length 34 [2023-12-21 23:37:08,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:08,922 INFO L495 AbstractCegarLoop]: Abstraction has 922 states and 1691 transitions. [2023-12-21 23:37:08,922 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:08,922 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1691 transitions. [2023-12-21 23:37:08,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-21 23:37:08,926 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:08,926 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:08,934 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:09,129 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:09,130 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:09,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:09,130 INFO L85 PathProgramCache]: Analyzing trace with hash -582127364, now seen corresponding path program 1 times [2023-12-21 23:37:09,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:09,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884286619] [2023-12-21 23:37:09,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:09,131 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:09,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:09,132 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:09,168 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:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:09,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 23:37:09,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:09,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:37:09,215 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:09,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:09,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884286619] [2023-12-21 23:37:09,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884286619] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:09,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:09,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 23:37:09,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136044561] [2023-12-21 23:37:09,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:09,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 23:37:09,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:09,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 23:37:09,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 23:37:09,216 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:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:09,259 INFO L93 Difference]: Finished difference Result 936 states and 1708 transitions. [2023-12-21 23:37:09,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 23:37:09,260 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:09,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:09,263 INFO L225 Difference]: With dead ends: 936 [2023-12-21 23:37:09,263 INFO L226 Difference]: Without dead ends: 934 [2023-12-21 23:37:09,264 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:09,264 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:09,264 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:09,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2023-12-21 23:37:09,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 930. [2023-12-21 23:37:09,278 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:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1698 transitions. [2023-12-21 23:37:09,281 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1698 transitions. Word has length 35 [2023-12-21 23:37:09,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:09,282 INFO L495 AbstractCegarLoop]: Abstraction has 930 states and 1698 transitions. [2023-12-21 23:37:09,282 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:09,284 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1698 transitions. [2023-12-21 23:37:09,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 23:37:09,288 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:09,288 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:09,293 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:09,491 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:09,492 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:09,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:09,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2127458807, now seen corresponding path program 1 times [2023-12-21 23:37:09,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:09,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684909103] [2023-12-21 23:37:09,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:09,495 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:09,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:09,496 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:09,500 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:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:09,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:09,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:09,589 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:09,590 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:09,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:09,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684909103] [2023-12-21 23:37:09,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684909103] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:09,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:09,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:37:09,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753805603] [2023-12-21 23:37:09,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:09,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:09,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:09,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:09,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:09,591 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:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:09,617 INFO L93 Difference]: Finished difference Result 1098 states and 1958 transitions. [2023-12-21 23:37:09,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:37:09,617 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:09,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:09,621 INFO L225 Difference]: With dead ends: 1098 [2023-12-21 23:37:09,621 INFO L226 Difference]: Without dead ends: 1009 [2023-12-21 23:37:09,622 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:09,622 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:09,623 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:09,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2023-12-21 23:37:09,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1007. [2023-12-21 23:37:09,635 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:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1814 transitions. [2023-12-21 23:37:09,637 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1814 transitions. Word has length 36 [2023-12-21 23:37:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:09,637 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1814 transitions. [2023-12-21 23:37:09,638 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:09,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1814 transitions. [2023-12-21 23:37:09,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 23:37:09,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:09,638 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:09,645 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:09,841 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:09,841 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:09,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:09,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1501802743, now seen corresponding path program 1 times [2023-12-21 23:37:09,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:09,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998737843] [2023-12-21 23:37:09,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:09,842 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:09,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:09,843 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:09,860 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:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:09,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:09,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:09,912 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:09,913 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:09,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:09,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998737843] [2023-12-21 23:37:09,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998737843] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:09,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:09,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:37:09,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431314647] [2023-12-21 23:37:09,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:09,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:09,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:09,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:09,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:09,914 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:09,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:09,940 INFO L93 Difference]: Finished difference Result 1433 states and 2457 transitions. [2023-12-21 23:37:09,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:37:09,940 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:09,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:09,944 INFO L225 Difference]: With dead ends: 1433 [2023-12-21 23:37:09,944 INFO L226 Difference]: Without dead ends: 1202 [2023-12-21 23:37:09,945 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:09,945 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:09,945 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:09,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2023-12-21 23:37:09,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1200. [2023-12-21 23:37:09,960 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:09,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 2094 transitions. [2023-12-21 23:37:09,962 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 2094 transitions. Word has length 36 [2023-12-21 23:37:09,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:09,962 INFO L495 AbstractCegarLoop]: Abstraction has 1200 states and 2094 transitions. [2023-12-21 23:37:09,962 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:09,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 2094 transitions. [2023-12-21 23:37:09,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 23:37:09,963 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:09,963 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:09,966 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:10,166 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:10,166 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:10,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:10,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1904431113, now seen corresponding path program 1 times [2023-12-21 23:37:10,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:10,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816392790] [2023-12-21 23:37:10,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:10,167 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:10,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:10,169 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:10,194 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:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:10,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:10,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:10,231 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:10,232 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:10,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:10,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816392790] [2023-12-21 23:37:10,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816392790] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:10,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:10,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:37:10,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365716095] [2023-12-21 23:37:10,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:10,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:10,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:10,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:10,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:10,233 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:10,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:10,262 INFO L93 Difference]: Finished difference Result 1976 states and 3234 transitions. [2023-12-21 23:37:10,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:37:10,262 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:10,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:10,267 INFO L225 Difference]: With dead ends: 1976 [2023-12-21 23:37:10,267 INFO L226 Difference]: Without dead ends: 1552 [2023-12-21 23:37:10,268 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:10,268 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:10,268 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:10,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2023-12-21 23:37:10,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1550. [2023-12-21 23:37:10,289 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:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2582 transitions. [2023-12-21 23:37:10,292 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2582 transitions. Word has length 36 [2023-12-21 23:37:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:10,292 INFO L495 AbstractCegarLoop]: Abstraction has 1550 states and 2582 transitions. [2023-12-21 23:37:10,292 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:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2582 transitions. [2023-12-21 23:37:10,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-21 23:37:10,293 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:10,293 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:10,296 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:10,496 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:10,496 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:10,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:10,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1853448570, now seen corresponding path program 1 times [2023-12-21 23:37:10,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:10,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679261682] [2023-12-21 23:37:10,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:10,497 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:10,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:10,498 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:10,500 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:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:10,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-21 23:37:10,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:11,076 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:11,077 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:37:11,311 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:11,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:11,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679261682] [2023-12-21 23:37:11,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679261682] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:37:11,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:37:11,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-21 23:37:11,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661957304] [2023-12-21 23:37:11,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:37:11,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 23:37:11,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:11,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 23:37:11,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-21 23:37:11,313 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:12,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:12,535 INFO L93 Difference]: Finished difference Result 3268 states and 5027 transitions. [2023-12-21 23:37:12,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 23:37:12,535 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:12,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:12,542 INFO L225 Difference]: With dead ends: 3268 [2023-12-21 23:37:12,542 INFO L226 Difference]: Without dead ends: 2714 [2023-12-21 23:37:12,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2023-12-21 23:37:12,544 INFO L413 NwaCegarLoop]: 1500 mSDtfsCounter, 3325 mSDsluCounter, 13527 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3325 SdHoareTripleChecker+Valid, 15027 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:12,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3325 Valid, 15027 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 23:37:12,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2023-12-21 23:37:12,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2322. [2023-12-21 23:37:12,589 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:12,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 3690 transitions. [2023-12-21 23:37:12,593 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 3690 transitions. Word has length 50 [2023-12-21 23:37:12,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:12,593 INFO L495 AbstractCegarLoop]: Abstraction has 2322 states and 3690 transitions. [2023-12-21 23:37:12,594 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:12,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 3690 transitions. [2023-12-21 23:37:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-21 23:37:12,594 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:12,594 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:12,607 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:37:12,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:37:12,798 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:12,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:12,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1815862662, now seen corresponding path program 1 times [2023-12-21 23:37:12,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:12,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190396505] [2023-12-21 23:37:12,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:12,799 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:12,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:12,800 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 23:37:12,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-21 23:37:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:12,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:12,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:37:12,872 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:12,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:12,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190396505] [2023-12-21 23:37:12,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190396505] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:12,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:12,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:37:12,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234887644] [2023-12-21 23:37:12,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:12,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:12,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:12,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:12,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:12,874 INFO L87 Difference]: Start difference. First operand 2322 states and 3690 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:37:12,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:12,947 INFO L93 Difference]: Finished difference Result 3444 states and 5327 transitions. [2023-12-21 23:37:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:37:12,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-12-21 23:37:12,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:12,953 INFO L225 Difference]: With dead ends: 3444 [2023-12-21 23:37:12,953 INFO L226 Difference]: Without dead ends: 1898 [2023-12-21 23:37:12,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:12,955 INFO L413 NwaCegarLoop]: 1526 mSDtfsCounter, 31 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3017 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:12,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3017 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:37:12,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2023-12-21 23:37:12,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1891. [2023-12-21 23:37:12,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1889 states have (on average 1.6236103758602436) internal successors, (3067), 1890 states have internal predecessors, (3067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:37:12,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 3067 transitions. [2023-12-21 23:37:12,992 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 3067 transitions. Word has length 50 [2023-12-21 23:37:12,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:12,992 INFO L495 AbstractCegarLoop]: Abstraction has 1891 states and 3067 transitions. [2023-12-21 23:37:12,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:37:12,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 3067 transitions. [2023-12-21 23:37:12,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-21 23:37:12,993 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:12,993 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:37:12,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-21 23:37:13,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:37:13,197 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:13,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:13,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1762784666, now seen corresponding path program 1 times [2023-12-21 23:37:13,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:13,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971875169] [2023-12-21 23:37:13,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:13,198 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:13,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:13,199 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 23:37:13,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-21 23:37:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:13,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:13,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:13,285 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:37:13,285 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:13,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:13,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971875169] [2023-12-21 23:37:13,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971875169] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:13,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:13,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:37:13,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641684073] [2023-12-21 23:37:13,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:13,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:13,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:13,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:13,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:13,286 INFO L87 Difference]: Start difference. First operand 1891 states and 3067 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:37:13,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:13,318 INFO L93 Difference]: Finished difference Result 2447 states and 3867 transitions. [2023-12-21 23:37:13,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:37:13,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-12-21 23:37:13,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:13,323 INFO L225 Difference]: With dead ends: 2447 [2023-12-21 23:37:13,323 INFO L226 Difference]: Without dead ends: 1341 [2023-12-21 23:37:13,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:13,324 INFO L413 NwaCegarLoop]: 1519 mSDtfsCounter, 27 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3002 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:13,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3002 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:37:13,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2023-12-21 23:37:13,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1339. [2023-12-21 23:37:13,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 1337 states have (on average 1.68810770381451) internal successors, (2257), 1338 states have internal predecessors, (2257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:37:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2257 transitions. [2023-12-21 23:37:13,348 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2257 transitions. Word has length 52 [2023-12-21 23:37:13,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:13,349 INFO L495 AbstractCegarLoop]: Abstraction has 1339 states and 2257 transitions. [2023-12-21 23:37:13,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:37:13,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2257 transitions. [2023-12-21 23:37:13,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-21 23:37:13,349 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:13,349 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:37:13,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-21 23:37:13,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:37:13,553 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:13,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:13,553 INFO L85 PathProgramCache]: Analyzing trace with hash 857932558, now seen corresponding path program 1 times [2023-12-21 23:37:13,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:13,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122985733] [2023-12-21 23:37:13,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:13,554 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:13,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:13,555 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 23:37:13,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-21 23:37:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:13,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-21 23:37:13,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:14,089 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:37:14,089 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:37:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:37:14,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:14,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122985733] [2023-12-21 23:37:14,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122985733] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:37:14,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:37:14,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-21 23:37:14,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853987325] [2023-12-21 23:37:14,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:37:14,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 23:37:14,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:14,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 23:37:14,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-21 23:37:14,302 INFO L87 Difference]: Start difference. First operand 1339 states and 2257 transitions. Second operand has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:37:14,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:14,971 INFO L93 Difference]: Finished difference Result 1933 states and 3088 transitions. [2023-12-21 23:37:14,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 23:37:14,972 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-12-21 23:37:14,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:14,975 INFO L225 Difference]: With dead ends: 1933 [2023-12-21 23:37:14,975 INFO L226 Difference]: Without dead ends: 1379 [2023-12-21 23:37:14,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2023-12-21 23:37:14,976 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.3s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:14,977 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.3s Time] [2023-12-21 23:37:14,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2023-12-21 23:37:14,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1353. [2023-12-21 23:37:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1351 states have (on average 1.682457438934123) internal successors, (2273), 1352 states have internal predecessors, (2273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:37:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2273 transitions. [2023-12-21 23:37:15,002 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 2273 transitions. Word has length 53 [2023-12-21 23:37:15,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:15,002 INFO L495 AbstractCegarLoop]: Abstraction has 1353 states and 2273 transitions. [2023-12-21 23:37:15,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:37:15,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 2273 transitions. [2023-12-21 23:37:15,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-21 23:37:15,003 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:15,003 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:37:15,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-12-21 23:37:15,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:37:15,206 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:15,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:15,206 INFO L85 PathProgramCache]: Analyzing trace with hash -443153606, now seen corresponding path program 1 times [2023-12-21 23:37:15,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:15,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077552500] [2023-12-21 23:37:15,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:15,207 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:15,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:15,209 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 23:37:15,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-21 23:37:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:15,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:15,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:15,325 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:37:15,325 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:15,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:15,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077552500] [2023-12-21 23:37:15,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077552500] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:15,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:15,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:37:15,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145624025] [2023-12-21 23:37:15,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:15,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:15,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:15,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:15,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:15,327 INFO L87 Difference]: Start difference. First operand 1353 states and 2273 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:37:15,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:15,354 INFO L93 Difference]: Finished difference Result 1633 states and 2665 transitions. [2023-12-21 23:37:15,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:37:15,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-12-21 23:37:15,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:15,357 INFO L225 Difference]: With dead ends: 1633 [2023-12-21 23:37:15,357 INFO L226 Difference]: Without dead ends: 1079 [2023-12-21 23:37:15,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:15,358 INFO L413 NwaCegarLoop]: 1512 mSDtfsCounter, 23 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:15,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2987 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:37:15,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2023-12-21 23:37:15,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1077. [2023-12-21 23:37:15,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1075 states have (on average 1.7404651162790699) internal successors, (1871), 1076 states have internal predecessors, (1871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:37:15,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1871 transitions. [2023-12-21 23:37:15,378 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1871 transitions. Word has length 55 [2023-12-21 23:37:15,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:15,378 INFO L495 AbstractCegarLoop]: Abstraction has 1077 states and 1871 transitions. [2023-12-21 23:37:15,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:37:15,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1871 transitions. [2023-12-21 23:37:15,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-21 23:37:15,379 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:15,379 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:37:15,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-12-21 23:37:15,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:37:15,582 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:15,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:15,583 INFO L85 PathProgramCache]: Analyzing trace with hash -294444102, now seen corresponding path program 1 times [2023-12-21 23:37:15,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:15,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899902711] [2023-12-21 23:37:15,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:15,583 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:15,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:15,585 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 23:37:15,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-21 23:37:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:15,676 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-21 23:37:15,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:37:16,187 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:37:16,460 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:37:16,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:16,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899902711] [2023-12-21 23:37:16,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899902711] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:37:16,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:37:16,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-21 23:37:16,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687275771] [2023-12-21 23:37:16,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:37:16,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 23:37:16,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:16,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 23:37:16,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-21 23:37:16,462 INFO L87 Difference]: Start difference. First operand 1077 states and 1871 transitions. Second operand has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:37:17,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:17,217 INFO L93 Difference]: Finished difference Result 1627 states and 2614 transitions. [2023-12-21 23:37:17,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-21 23:37:17,217 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2023-12-21 23:37:17,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:17,221 INFO L225 Difference]: With dead ends: 1627 [2023-12-21 23:37:17,221 INFO L226 Difference]: Without dead ends: 1349 [2023-12-21 23:37:17,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2023-12-21 23:37:17,222 INFO L413 NwaCegarLoop]: 1509 mSDtfsCounter, 6215 mSDsluCounter, 10471 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6215 SdHoareTripleChecker+Valid, 11980 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:17,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6215 Valid, 11980 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 23:37:17,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2023-12-21 23:37:17,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1285. [2023-12-21 23:37:17,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1283 states have (on average 1.6703039750584567) internal successors, (2143), 1284 states have internal predecessors, (2143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:37:17,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 2143 transitions. [2023-12-21 23:37:17,246 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 2143 transitions. Word has length 56 [2023-12-21 23:37:17,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:17,247 INFO L495 AbstractCegarLoop]: Abstraction has 1285 states and 2143 transitions. [2023-12-21 23:37:17,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:37:17,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 2143 transitions. [2023-12-21 23:37:17,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-21 23:37:17,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:17,247 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:37:17,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-21 23:37:17,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:37:17,450 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:17,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:17,451 INFO L85 PathProgramCache]: Analyzing trace with hash -402890190, now seen corresponding path program 1 times [2023-12-21 23:37:17,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:17,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005925909] [2023-12-21 23:37:17,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:17,451 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:17,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:17,452 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 23:37:17,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-21 23:37:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:17,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 23:37:17,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:17,578 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 23:37:17,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:37:17,664 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 23:37:17,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:17,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005925909] [2023-12-21 23:37:17,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005925909] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:37:17,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:37:17,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-21 23:37:17,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701542481] [2023-12-21 23:37:17,664 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:37:17,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 23:37:17,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:17,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 23:37:17,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 23:37:17,665 INFO L87 Difference]: Start difference. First operand 1285 states and 2143 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:37:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:17,736 INFO L93 Difference]: Finished difference Result 2233 states and 3384 transitions. [2023-12-21 23:37:17,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:37:17,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-12-21 23:37:17,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:17,740 INFO L225 Difference]: With dead ends: 2233 [2023-12-21 23:37:17,740 INFO L226 Difference]: Without dead ends: 1747 [2023-12-21 23:37:17,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 23:37:17,742 INFO L413 NwaCegarLoop]: 1510 mSDtfsCounter, 1486 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 3094 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:17,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 3094 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:37:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2023-12-21 23:37:17,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1691. [2023-12-21 23:37:17,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1689 states have (on average 1.5476613380698638) internal successors, (2614), 1690 states have internal predecessors, (2614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:37:17,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2614 transitions. [2023-12-21 23:37:17,775 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2614 transitions. Word has length 58 [2023-12-21 23:37:17,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:17,776 INFO L495 AbstractCegarLoop]: Abstraction has 1691 states and 2614 transitions. [2023-12-21 23:37:17,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:37:17,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2614 transitions. [2023-12-21 23:37:17,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-21 23:37:17,776 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:17,776 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] [2023-12-21 23:37:17,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-12-21 23:37:17,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:37:17,979 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:17,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:17,980 INFO L85 PathProgramCache]: Analyzing trace with hash -56380255, now seen corresponding path program 1 times [2023-12-21 23:37:17,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:17,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166955330] [2023-12-21 23:37:17,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:17,980 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:17,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:17,981 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 23:37:17,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-21 23:37:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:18,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:18,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:18,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:18,098 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:18,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:18,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166955330] [2023-12-21 23:37:18,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166955330] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:18,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:18,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 23:37:18,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360343170] [2023-12-21 23:37:18,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:18,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:18,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:18,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:18,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:18,100 INFO L87 Difference]: Start difference. First operand 1691 states and 2614 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:53,006 INFO L93 Difference]: Finished difference Result 3195 states and 5487 transitions. [2023-12-21 23:37:53,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:37:53,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-12-21 23:37:53,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:53,013 INFO L225 Difference]: With dead ends: 3195 [2023-12-21 23:37:53,014 INFO L226 Difference]: Without dead ends: 2442 [2023-12-21 23:37:53,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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:53,015 INFO L413 NwaCegarLoop]: 603 mSDtfsCounter, 800 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2200 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 2864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 2200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.7s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:53,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 610 Invalid, 2864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 2200 Invalid, 0 Unknown, 0 Unchecked, 34.7s Time] [2023-12-21 23:37:53,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2023-12-21 23:37:53,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2442. [2023-12-21 23:37:53,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 2440 states have (on average 1.443032786885246) internal successors, (3521), 2441 states have internal predecessors, (3521), 0 states have call successors, (0), 0 states 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,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3521 transitions. [2023-12-21 23:37:53,083 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3521 transitions. Word has length 62 [2023-12-21 23:37:53,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:53,084 INFO L495 AbstractCegarLoop]: Abstraction has 2442 states and 3521 transitions. [2023-12-21 23:37:53,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3521 transitions. [2023-12-21 23:37:53,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-21 23:37:53,087 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:53,087 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:37:53,110 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:37:53,289 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:37:53,289 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:53,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:53,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1592884220, now seen corresponding path program 1 times [2023-12-21 23:37:53,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:53,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279032180] [2023-12-21 23:37:53,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:53,291 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,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:53,292 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:37:53,293 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:37:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:53,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-21 23:37:53,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:54,473 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:37:54,474 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:37:54,905 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:37:54,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:54,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279032180] [2023-12-21 23:37:54,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279032180] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:37:54,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:37:54,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-21 23:37:54,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449868767] [2023-12-21 23:37:54,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:37:54,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:37:54,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:54,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:37:54,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:37:54,907 INFO L87 Difference]: Start difference. First operand 2442 states and 3521 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:37:56,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:56,580 INFO L93 Difference]: Finished difference Result 3030 states and 4276 transitions. [2023-12-21 23:37:56,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-21 23:37:56,581 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:37:56,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:56,587 INFO L225 Difference]: With dead ends: 3030 [2023-12-21 23:37:56,587 INFO L226 Difference]: Without dead ends: 2466 [2023-12-21 23:37:56,588 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:37:56,588 INFO L413 NwaCegarLoop]: 1493 mSDtfsCounter, 11952 mSDsluCounter, 9180 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11952 SdHoareTripleChecker+Valid, 10673 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:56,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11952 Valid, 10673 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-21 23:37:56,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2023-12-21 23:37:56,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 2442. [2023-12-21 23:37:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 2440 states have (on average 1.4360655737704917) internal successors, (3504), 2441 states have internal predecessors, (3504), 0 states have call successors, (0), 0 states 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,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3504 transitions. [2023-12-21 23:37:56,632 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3504 transitions. Word has length 91 [2023-12-21 23:37:56,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:56,632 INFO L495 AbstractCegarLoop]: Abstraction has 2442 states and 3504 transitions. [2023-12-21 23:37:56,632 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:37:56,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3504 transitions. [2023-12-21 23:37:56,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-21 23:37:56,633 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:56,633 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:37:56,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-12-21 23:37:56,836 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:37:56,836 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:56,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:56,837 INFO L85 PathProgramCache]: Analyzing trace with hash -354529050, now seen corresponding path program 1 times [2023-12-21 23:37:56,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:56,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156061696] [2023-12-21 23:37:56,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:56,837 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,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:56,838 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:37:56,839 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:37:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:56,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-21 23:37:56,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:57,850 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:37:57,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:37:58,333 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:37:58,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:58,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156061696] [2023-12-21 23:37:58,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156061696] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:37:58,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:37:58,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-21 23:37:58,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585174126] [2023-12-21 23:37:58,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:37:58,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:37:58,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:58,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:37:58,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:37:58,335 INFO L87 Difference]: Start difference. First operand 2442 states and 3504 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:37:59,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:59,985 INFO L93 Difference]: Finished difference Result 3138 states and 4384 transitions. [2023-12-21 23:37:59,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-21 23:37:59,986 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:37:59,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:59,995 INFO L225 Difference]: With dead ends: 3138 [2023-12-21 23:37:59,995 INFO L226 Difference]: Without dead ends: 2444 [2023-12-21 23:37:59,996 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:37:59,997 INFO L413 NwaCegarLoop]: 1493 mSDtfsCounter, 19081 mSDsluCounter, 7622 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19081 SdHoareTripleChecker+Valid, 9115 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:59,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19081 Valid, 9115 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-21 23:37:59,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2023-12-21 23:38:00,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 2442. [2023-12-21 23:38:00,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 2440 states have (on average 1.4295081967213115) internal successors, (3488), 2441 states have internal predecessors, (3488), 0 states have call successors, (0), 0 states 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,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3488 transitions. [2023-12-21 23:38:00,046 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3488 transitions. Word has length 92 [2023-12-21 23:38:00,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:00,047 INFO L495 AbstractCegarLoop]: Abstraction has 2442 states and 3488 transitions. [2023-12-21 23:38:00,047 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:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3488 transitions. [2023-12-21 23:38:00,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-21 23:38:00,048 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:00,048 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:00,056 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 (19)] Ended with exit code 0 [2023-12-21 23:38:00,251 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:00,251 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:00,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:00,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1749922772, now seen corresponding path program 1 times [2023-12-21 23:38:00,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:00,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336741040] [2023-12-21 23:38:00,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:00,252 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,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:00,254 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:00,256 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:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:00,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 23:38:00,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:01,489 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:01,489 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:02,018 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:02,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:02,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336741040] [2023-12-21 23:38:02,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336741040] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:02,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:02,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-21 23:38:02,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366079923] [2023-12-21 23:38:02,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:02,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:38:02,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:02,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:38:02,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:38:02,021 INFO L87 Difference]: Start difference. First operand 2442 states and 3488 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:04,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:04,353 INFO L93 Difference]: Finished difference Result 3202 states and 4435 transitions. [2023-12-21 23:38:04,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-21 23:38:04,356 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:04,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:04,360 INFO L225 Difference]: With dead ends: 3202 [2023-12-21 23:38:04,360 INFO L226 Difference]: Without dead ends: 2824 [2023-12-21 23:38:04,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=306, Invalid=1950, Unknown=0, NotChecked=0, Total=2256 [2023-12-21 23:38:04,362 INFO L413 NwaCegarLoop]: 1518 mSDtfsCounter, 4744 mSDsluCounter, 22638 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4744 SdHoareTripleChecker+Valid, 24156 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:04,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4744 Valid, 24156 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-21 23:38:04,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2023-12-21 23:38:04,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 2326. [2023-12-21 23:38:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2326 states, 2324 states have (on average 1.4419104991394147) internal successors, (3351), 2325 states have internal predecessors, (3351), 0 states have call successors, (0), 0 states 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,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 3351 transitions. [2023-12-21 23:38:04,407 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 3351 transitions. Word has length 93 [2023-12-21 23:38:04,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:04,407 INFO L495 AbstractCegarLoop]: Abstraction has 2326 states and 3351 transitions. [2023-12-21 23:38:04,407 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:04,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 3351 transitions. [2023-12-21 23:38:04,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-21 23:38:04,408 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:04,408 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:04,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 (20)] Ended with exit code 0 [2023-12-21 23:38:04,609 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:04,609 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:04,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:04,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2104628344, now seen corresponding path program 1 times [2023-12-21 23:38:04,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:04,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537246683] [2023-12-21 23:38:04,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:04,610 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,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:04,611 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:04,612 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:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:04,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 23:38:04,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:05,737 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:05,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:06,222 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:06,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:06,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [537246683] [2023-12-21 23:38:06,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [537246683] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:06,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:06,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-21 23:38:06,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586121485] [2023-12-21 23:38:06,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:06,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:38:06,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:06,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:38:06,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:38:06,225 INFO L87 Difference]: Start difference. First operand 2326 states and 3351 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:10,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:10,998 INFO L93 Difference]: Finished difference Result 2976 states and 4150 transitions. [2023-12-21 23:38:10,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-21 23:38:10,998 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:10,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:11,002 INFO L225 Difference]: With dead ends: 2976 [2023-12-21 23:38:11,002 INFO L226 Difference]: Without dead ends: 2694 [2023-12-21 23:38:11,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=863, Invalid=3967, Unknown=0, NotChecked=0, Total=4830 [2023-12-21 23:38:11,005 INFO L413 NwaCegarLoop]: 1578 mSDtfsCounter, 1831 mSDsluCounter, 21581 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1831 SdHoareTripleChecker+Valid, 23159 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:11,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1831 Valid, 23159 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-21 23:38:11,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2023-12-21 23:38:11,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2494. [2023-12-21 23:38:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2494 states, 2492 states have (on average 1.4237560192616372) internal successors, (3548), 2493 states have internal predecessors, (3548), 0 states have call successors, (0), 0 states 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:11,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2494 states and 3548 transitions. [2023-12-21 23:38:11,093 INFO L78 Accepts]: Start accepts. Automaton has 2494 states and 3548 transitions. Word has length 93 [2023-12-21 23:38:11,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:11,093 INFO L495 AbstractCegarLoop]: Abstraction has 2494 states and 3548 transitions. [2023-12-21 23:38:11,093 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:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 3548 transitions. [2023-12-21 23:38:11,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-21 23:38:11,094 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:11,094 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:11,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-12-21 23:38:11,297 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:11,297 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:11,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:11,298 INFO L85 PathProgramCache]: Analyzing trace with hash -404456876, now seen corresponding path program 1 times [2023-12-21 23:38:11,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:11,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385782896] [2023-12-21 23:38:11,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:11,298 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:11,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:11,299 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:11,301 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:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:11,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 23:38:11,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:12,509 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:12,510 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:12,994 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:12,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:12,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385782896] [2023-12-21 23:38:12,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385782896] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:12,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:12,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-21 23:38:12,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718566190] [2023-12-21 23:38:12,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:12,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:38:12,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:12,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:38:12,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:38:12,996 INFO L87 Difference]: Start difference. First operand 2494 states and 3548 transitions. Second operand has 26 states, 26 states have (on average 6.538461538461538) internal successors, (170), 26 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:18,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:18,464 INFO L93 Difference]: Finished difference Result 4138 states and 5525 transitions. [2023-12-21 23:38:18,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-12-21 23:38:18,465 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.538461538461538) internal successors, (170), 26 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2023-12-21 23:38:18,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:18,470 INFO L225 Difference]: With dead ends: 4138 [2023-12-21 23:38:18,470 INFO L226 Difference]: Without dead ends: 3838 [2023-12-21 23:38:18,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1011, Invalid=4995, Unknown=0, NotChecked=0, Total=6006 [2023-12-21 23:38:18,472 INFO L413 NwaCegarLoop]: 1594 mSDtfsCounter, 4935 mSDsluCounter, 23300 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4935 SdHoareTripleChecker+Valid, 24894 SdHoareTripleChecker+Invalid, 1992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:18,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4935 Valid, 24894 Invalid, 1992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1971 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-21 23:38:18,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3838 states. [2023-12-21 23:38:18,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3838 to 3197. [2023-12-21 23:38:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3197 states, 3195 states have (on average 1.3737089201877934) internal successors, (4389), 3196 states have internal predecessors, (4389), 0 states have call successors, (0), 0 states 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:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3197 states to 3197 states and 4389 transitions. [2023-12-21 23:38:18,563 INFO L78 Accepts]: Start accepts. Automaton has 3197 states and 4389 transitions. Word has length 93 [2023-12-21 23:38:18,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:18,563 INFO L495 AbstractCegarLoop]: Abstraction has 3197 states and 4389 transitions. [2023-12-21 23:38:18,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.538461538461538) internal successors, (170), 26 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:18,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3197 states and 4389 transitions. [2023-12-21 23:38:18,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 23:38:18,565 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:18,565 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:38:18,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-12-21 23:38:18,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:38:18,768 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:18,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:18,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1227951098, now seen corresponding path program 2 times [2023-12-21 23:38:18,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:18,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193269136] [2023-12-21 23:38:18,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 23:38:18,769 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:18,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:18,770 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 23:38:18,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-21 23:38:18,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 23:38:18,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 23:38:18,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:38:18,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:19,277 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:38:19,277 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:19,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:19,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193269136] [2023-12-21 23:38:19,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193269136] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:19,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:19,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 23:38:19,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303624014] [2023-12-21 23:38:19,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:19,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 23:38:19,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:19,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 23:38:19,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:38:19,279 INFO L87 Difference]: Start difference. First operand 3197 states and 4389 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:38:19,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:19,417 INFO L93 Difference]: Finished difference Result 3979 states and 5378 transitions. [2023-12-21 23:38:19,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:38:19,420 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:38:19,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:19,424 INFO L225 Difference]: With dead ends: 3979 [2023-12-21 23:38:19,424 INFO L226 Difference]: Without dead ends: 3325 [2023-12-21 23:38:19,425 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:38:19,425 INFO L413 NwaCegarLoop]: 1531 mSDtfsCounter, 1526 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 3102 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:19,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 3102 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 23:38:19,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3325 states. [2023-12-21 23:38:19,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3325 to 3189. [2023-12-21 23:38:19,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3189 states, 3187 states have (on average 1.3646062127392533) internal successors, (4349), 3188 states have internal predecessors, (4349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:19,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4349 transitions. [2023-12-21 23:38:19,512 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4349 transitions. Word has length 130 [2023-12-21 23:38:19,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:19,512 INFO L495 AbstractCegarLoop]: Abstraction has 3189 states and 4349 transitions. [2023-12-21 23:38:19,512 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:38:19,512 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4349 transitions. [2023-12-21 23:38:19,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 23:38:19,514 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:19,514 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:38:19,517 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:38:19,716 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:38:19,717 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:19,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:19,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1582656670, now seen corresponding path program 2 times [2023-12-21 23:38:19,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:19,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416014929] [2023-12-21 23:38:19,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 23:38:19,718 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:19,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:19,719 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:38:19,749 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:38:19,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 23:38:19,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 23:38:19,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:38:19,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:20,262 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:38:20,263 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:20,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:20,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416014929] [2023-12-21 23:38:20,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416014929] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:20,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:20,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 23:38:20,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222868841] [2023-12-21 23:38:20,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:20,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 23:38:20,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:20,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 23:38:20,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:38:20,264 INFO L87 Difference]: Start difference. First operand 3189 states and 4349 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:38:20,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:20,420 INFO L93 Difference]: Finished difference Result 3758 states and 5085 transitions. [2023-12-21 23:38:20,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:38:20,420 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:38:20,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:20,424 INFO L225 Difference]: With dead ends: 3758 [2023-12-21 23:38:20,424 INFO L226 Difference]: Without dead ends: 3429 [2023-12-21 23:38:20,425 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:38:20,425 INFO L413 NwaCegarLoop]: 1534 mSDtfsCounter, 1523 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 3120 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:20,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 3120 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 23:38:20,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3429 states. [2023-12-21 23:38:20,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3429 to 3361. [2023-12-21 23:38:20,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3361 states, 3359 states have (on average 1.3515927359333135) internal successors, (4540), 3360 states have internal predecessors, (4540), 0 states have call successors, (0), 0 states 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:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3361 states to 3361 states and 4540 transitions. [2023-12-21 23:38:20,518 INFO L78 Accepts]: Start accepts. Automaton has 3361 states and 4540 transitions. Word has length 130 [2023-12-21 23:38:20,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:20,518 INFO L495 AbstractCegarLoop]: Abstraction has 3361 states and 4540 transitions. [2023-12-21 23:38:20,518 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:38:20,519 INFO L276 IsEmpty]: Start isEmpty. Operand 3361 states and 4540 transitions. [2023-12-21 23:38:20,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 23:38:20,520 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:20,520 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:38:20,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-12-21 23:38:20,723 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:38:20,723 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:20,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:20,723 INFO L85 PathProgramCache]: Analyzing trace with hash -926428550, now seen corresponding path program 2 times [2023-12-21 23:38:20,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:20,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815967480] [2023-12-21 23:38:20,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 23:38:20,724 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:20,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:20,725 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:38:20,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-21 23:38:20,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 23:38:20,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 23:38:20,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:38:20,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:21,229 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:38:21,230 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:21,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:21,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815967480] [2023-12-21 23:38:21,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815967480] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:21,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:21,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 23:38:21,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940281862] [2023-12-21 23:38:21,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:21,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 23:38:21,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:21,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 23:38:21,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:38:21,231 INFO L87 Difference]: Start difference. First operand 3361 states and 4540 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:38:21,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:21,418 INFO L93 Difference]: Finished difference Result 3885 states and 5216 transitions. [2023-12-21 23:38:21,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:38:21,418 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:38:21,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:21,423 INFO L225 Difference]: With dead ends: 3885 [2023-12-21 23:38:21,423 INFO L226 Difference]: Without dead ends: 3611 [2023-12-21 23:38:21,424 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:38:21,424 INFO L413 NwaCegarLoop]: 1534 mSDtfsCounter, 2962 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2962 SdHoareTripleChecker+Valid, 3102 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:21,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2962 Valid, 3102 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 23:38:21,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3611 states. [2023-12-21 23:38:21,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3611 to 3543. [2023-12-21 23:38:21,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3543 states, 3541 states have (on average 1.341428974865857) internal successors, (4750), 3542 states have internal predecessors, (4750), 0 states have call successors, (0), 0 states 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:21,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3543 states to 3543 states and 4750 transitions. [2023-12-21 23:38:21,531 INFO L78 Accepts]: Start accepts. Automaton has 3543 states and 4750 transitions. Word has length 130 [2023-12-21 23:38:21,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:21,531 INFO L495 AbstractCegarLoop]: Abstraction has 3543 states and 4750 transitions. [2023-12-21 23:38:21,531 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:38:21,531 INFO L276 IsEmpty]: Start isEmpty. Operand 3543 states and 4750 transitions. [2023-12-21 23:38:21,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-21 23:38:21,533 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:21,533 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:38:21,536 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:38:21,736 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:38:21,736 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:21,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:21,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1193260010, now seen corresponding path program 1 times [2023-12-21 23:38:21,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:21,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790208405] [2023-12-21 23:38:21,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:21,738 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:21,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:21,739 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:38:21,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 (26)] Waiting until timeout for monitored process [2023-12-21 23:38:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:21,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 23:38:21,835 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:22,992 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:38:22,992 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:23,910 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:38:23,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:23,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790208405] [2023-12-21 23:38:23,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790208405] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:23,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:23,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-21 23:38:23,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427526260] [2023-12-21 23:38:23,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:23,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 23:38:23,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:23,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 23:38:23,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1006, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 23:38:23,912 INFO L87 Difference]: Start difference. First operand 3543 states and 4750 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:38:58,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:58,782 INFO L93 Difference]: Finished difference Result 13070 states and 16224 transitions. [2023-12-21 23:38:58,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 262 states. [2023-12-21 23:38:58,783 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:38:58,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:58,794 INFO L225 Difference]: With dead ends: 13070 [2023-12-21 23:38:58,794 INFO L226 Difference]: Without dead ends: 12478 [2023-12-21 23:38:58,804 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:38:58,804 INFO L413 NwaCegarLoop]: 1680 mSDtfsCounter, 23225 mSDsluCounter, 17026 mSDsCounter, 0 mSdLazyCounter, 4156 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23225 SdHoareTripleChecker+Valid, 18706 SdHoareTripleChecker+Invalid, 4245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 4156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:58,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23225 Valid, 18706 Invalid, 4245 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [89 Valid, 4156 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2023-12-21 23:38:58,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12478 states. [2023-12-21 23:38:59,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12478 to 11674. [2023-12-21 23:38:59,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11674 states, 11672 states have (on average 1.2396333104866346) internal successors, (14469), 11673 states have internal predecessors, (14469), 0 states have call successors, (0), 0 states 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:59,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11674 states to 11674 states and 14469 transitions. [2023-12-21 23:38:59,252 INFO L78 Accepts]: Start accepts. Automaton has 11674 states and 14469 transitions. Word has length 131 [2023-12-21 23:38:59,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:59,252 INFO L495 AbstractCegarLoop]: Abstraction has 11674 states and 14469 transitions. [2023-12-21 23:38:59,252 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:38:59,252 INFO L276 IsEmpty]: Start isEmpty. Operand 11674 states and 14469 transitions. [2023-12-21 23:38:59,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-21 23:38:59,257 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:59,257 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:38:59,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-12-21 23:38:59,460 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:38:59,461 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:59,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:59,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1665490502, now seen corresponding path program 1 times [2023-12-21 23:38:59,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:59,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031297584] [2023-12-21 23:38:59,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:59,462 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:59,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:59,462 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:38:59,476 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:38:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:59,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-21 23:38:59,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:39:01,690 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:01,690 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:39:04,078 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:04,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:39:04,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031297584] [2023-12-21 23:39:04,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031297584] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:39:04,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:39:04,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 39 [2023-12-21 23:39:04,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669706332] [2023-12-21 23:39:04,079 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:39:04,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-21 23:39:04,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:39:04,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-21 23:39:04,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1318, Unknown=0, NotChecked=0, Total=1482 [2023-12-21 23:39:04,080 INFO L87 Difference]: Start difference. First operand 11674 states and 14469 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:39:43,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:39:43,294 INFO L93 Difference]: Finished difference Result 21489 states and 26201 transitions. [2023-12-21 23:39:43,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2023-12-21 23:39:43,296 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:39:43,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:39:43,309 INFO L225 Difference]: With dead ends: 21489 [2023-12-21 23:39:43,309 INFO L226 Difference]: Without dead ends: 16224 [2023-12-21 23:39:43,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12543 ImplicationChecksByTransitivity, 34.9s TimeCoverageRelationStatistics Valid=4990, Invalid=30166, Unknown=0, NotChecked=0, Total=35156 [2023-12-21 23:39:43,315 INFO L413 NwaCegarLoop]: 1543 mSDtfsCounter, 25214 mSDsluCounter, 17270 mSDsCounter, 0 mSdLazyCounter, 1980 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25214 SdHoareTripleChecker+Valid, 18813 SdHoareTripleChecker+Invalid, 2142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-12-21 23:39:43,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25214 Valid, 18813 Invalid, 2142 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [162 Valid, 1980 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2023-12-21 23:39:43,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16224 states. [2023-12-21 23:39:43,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16224 to 14007. [2023-12-21 23:39:43,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14007 states, 14005 states have (on average 1.2277757943591574) internal successors, (17195), 14006 states have internal predecessors, (17195), 0 states have call successors, (0), 0 states 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:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14007 states to 14007 states and 17195 transitions. [2023-12-21 23:39:43,930 INFO L78 Accepts]: Start accepts. Automaton has 14007 states and 17195 transitions. Word has length 131 [2023-12-21 23:39:43,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:39:43,931 INFO L495 AbstractCegarLoop]: Abstraction has 14007 states and 17195 transitions. [2023-12-21 23:39:43,931 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:39:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 14007 states and 17195 transitions. [2023-12-21 23:39:43,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-21 23:39:43,935 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:39:43,935 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:39:43,948 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:39:44,138 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:39:44,138 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:39:44,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:39:44,139 INFO L85 PathProgramCache]: Analyzing trace with hash -998141848, now seen corresponding path program 1 times [2023-12-21 23:39:44,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:39:44,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952856768] [2023-12-21 23:39:44,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:39:44,139 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:44,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:39:44,141 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:39:44,142 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:39:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:39:44,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-21 23:39:44,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:39:45,934 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:39:45,934 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:39:47,263 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:39:47,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:39:47,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952856768] [2023-12-21 23:39:47,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952856768] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:39:47,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:39:47,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-21 23:39:47,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291876420] [2023-12-21 23:39:47,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:39:47,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 23:39:47,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:39:47,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 23:39:47,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 23:39:47,265 INFO L87 Difference]: Start difference. First operand 14007 states and 17195 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:40:12,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:40:12,615 INFO L93 Difference]: Finished difference Result 23005 states and 27916 transitions. [2023-12-21 23:40:12,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2023-12-21 23:40:12,616 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:40:12,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:40:12,629 INFO L225 Difference]: With dead ends: 23005 [2023-12-21 23:40:12,630 INFO L226 Difference]: Without dead ends: 16137 [2023-12-21 23:40:12,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7206 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=3210, Invalid=17382, Unknown=0, NotChecked=0, Total=20592 [2023-12-21 23:40:12,636 INFO L413 NwaCegarLoop]: 1535 mSDtfsCounter, 17253 mSDsluCounter, 14671 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17253 SdHoareTripleChecker+Valid, 16206 SdHoareTripleChecker+Invalid, 1941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-21 23:40:12,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17253 Valid, 16206 Invalid, 1941 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [92 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-12-21 23:40:12,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16137 states. [2023-12-21 23:40:13,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16137 to 14912. [2023-12-21 23:40:13,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14912 states, 14910 states have (on average 1.2220657276995306) internal successors, (18221), 14911 states have internal predecessors, (18221), 0 states have call successors, (0), 0 states 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:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14912 states to 14912 states and 18221 transitions. [2023-12-21 23:40:13,369 INFO L78 Accepts]: Start accepts. Automaton has 14912 states and 18221 transitions. Word has length 132 [2023-12-21 23:40:13,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:40:13,369 INFO L495 AbstractCegarLoop]: Abstraction has 14912 states and 18221 transitions. [2023-12-21 23:40:13,369 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:40:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 14912 states and 18221 transitions. [2023-12-21 23:40:13,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-21 23:40:13,400 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:40:13,400 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:13,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-12-21 23:40:13,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:40:13,604 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:40:13,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:40:13,605 INFO L85 PathProgramCache]: Analyzing trace with hash 250812344, now seen corresponding path program 1 times [2023-12-21 23:40:13,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:40:13,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824907126] [2023-12-21 23:40:13,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:40:13,605 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:13,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:40:13,606 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 23:40:13,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-21 23:40:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:40:13,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-21 23:40:13,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:40:15,428 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:40:15,428 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:40:16,847 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:40:16,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:40:16,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824907126] [2023-12-21 23:40:16,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824907126] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:40:16,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:40:16,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-21 23:40:16,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624467382] [2023-12-21 23:40:16,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:40:16,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 23:40:16,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:40:16,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 23:40:16,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=989, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 23:40:16,849 INFO L87 Difference]: Start difference. First operand 14912 states and 18221 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:40:46,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:40:46,785 INFO L93 Difference]: Finished difference Result 28881 states and 34929 transitions. [2023-12-21 23:40:46,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2023-12-21 23:40:46,786 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:40:46,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:40:46,805 INFO L225 Difference]: With dead ends: 28881 [2023-12-21 23:40:46,806 INFO L226 Difference]: Without dead ends: 22492 [2023-12-21 23:40:46,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10750 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=4570, Invalid=24842, Unknown=0, NotChecked=0, Total=29412 [2023-12-21 23:40:46,811 INFO L413 NwaCegarLoop]: 1571 mSDtfsCounter, 26601 mSDsluCounter, 14650 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26601 SdHoareTripleChecker+Valid, 16221 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-21 23:40:46,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26601 Valid, 16221 Invalid, 1688 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [120 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-12-21 23:40:46,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22492 states. [2023-12-21 23:40:47,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22492 to 16419. [2023-12-21 23:40:47,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16419 states, 16417 states have (on average 1.2208076993360542) internal successors, (20042), 16418 states have internal predecessors, (20042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:40:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16419 states to 16419 states and 20042 transitions. [2023-12-21 23:40:47,667 INFO L78 Accepts]: Start accepts. Automaton has 16419 states and 20042 transitions. Word has length 132 [2023-12-21 23:40:47,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:40:47,667 INFO L495 AbstractCegarLoop]: Abstraction has 16419 states and 20042 transitions. [2023-12-21 23:40:47,668 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:40:47,668 INFO L276 IsEmpty]: Start isEmpty. Operand 16419 states and 20042 transitions. [2023-12-21 23:40:47,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-21 23:40:47,670 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:40:47,671 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:40:47,676 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:40:47,874 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:40:47,874 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:40:47,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:40:47,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1794314758, now seen corresponding path program 1 times [2023-12-21 23:40:47,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:40:47,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364107406] [2023-12-21 23:40:47,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:40:47,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:40:47,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:40:47,877 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:40:47,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-12-21 23:40:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:40:47,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-21 23:40:47,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:40:50,076 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:40:50,077 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:40:51,964 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:40:51,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:40:51,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364107406] [2023-12-21 23:40:51,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364107406] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:40:51,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:40:51,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 36 [2023-12-21 23:40:51,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034977561] [2023-12-21 23:40:51,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:40:51,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-21 23:40:51,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:40:51,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-21 23:40:51,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2023-12-21 23:40:51,965 INFO L87 Difference]: Start difference. First operand 16419 states and 20042 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:41:15,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:41:15,563 INFO L93 Difference]: Finished difference Result 33999 states and 41154 transitions. [2023-12-21 23:41:15,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2023-12-21 23:41:15,565 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:41:15,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:41:15,582 INFO L225 Difference]: With dead ends: 33999 [2023-12-21 23:41:15,582 INFO L226 Difference]: Without dead ends: 21717 [2023-12-21 23:41:15,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7109 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=4005, Invalid=16875, Unknown=0, NotChecked=0, Total=20880 [2023-12-21 23:41:15,594 INFO L413 NwaCegarLoop]: 1542 mSDtfsCounter, 20970 mSDsluCounter, 17380 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20970 SdHoareTripleChecker+Valid, 18922 SdHoareTripleChecker+Invalid, 2332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:41:15,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20970 Valid, 18922 Invalid, 2332 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [66 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-12-21 23:41:15,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21717 states. [2023-12-21 23:41:16,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21717 to 19494. [2023-12-21 23:41:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19494 states, 19492 states have (on average 1.2185512004925096) internal successors, (23752), 19493 states have internal predecessors, (23752), 0 states have call successors, (0), 0 states 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:16,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19494 states to 19494 states and 23752 transitions. [2023-12-21 23:41:16,795 INFO L78 Accepts]: Start accepts. Automaton has 19494 states and 23752 transitions. Word has length 133 [2023-12-21 23:41:16,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:41:16,795 INFO L495 AbstractCegarLoop]: Abstraction has 19494 states and 23752 transitions. [2023-12-21 23:41:16,795 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:41:16,795 INFO L276 IsEmpty]: Start isEmpty. Operand 19494 states and 23752 transitions. [2023-12-21 23:41:16,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-21 23:41:16,798 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:41:16,798 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:41:16,802 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 (30)] Ended with exit code 0 [2023-12-21 23:41:17,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:41:17,002 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:41:17,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:41:17,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1464443256, now seen corresponding path program 1 times [2023-12-21 23:41:17,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:41:17,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994465585] [2023-12-21 23:41:17,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:41:17,003 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:17,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:41:17,004 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 23:41:17,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-21 23:41:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:41:17,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 23:41:17,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:41:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:41:17,690 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:41:17,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:41:17,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994465585] [2023-12-21 23:41:17,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994465585] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:41:17,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:41:17,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:41:17,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177042537] [2023-12-21 23:41:17,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:41:17,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 23:41:17,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:41:17,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 23:41:17,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-21 23:41:17,692 INFO L87 Difference]: Start difference. First operand 19494 states and 23752 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states 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:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:41:48,449 INFO L93 Difference]: Finished difference Result 21783 states and 27037 transitions. [2023-12-21 23:41:48,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 23:41:48,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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:41:48,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:41:48,465 INFO L225 Difference]: With dead ends: 21783 [2023-12-21 23:41:48,465 INFO L226 Difference]: Without dead ends: 20245 [2023-12-21 23:41:48,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-21 23:41:48,468 INFO L413 NwaCegarLoop]: 747 mSDtfsCounter, 745 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 2968 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 3112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.7s IncrementalHoareTripleChecker+Time [2023-12-21 23:41:48,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 822 Invalid, 3112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 2968 Invalid, 0 Unknown, 0 Unchecked, 29.7s Time] [2023-12-21 23:41:48,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20245 states. [2023-12-21 23:41:49,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20245 to 20245. [2023-12-21 23:41:49,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20245 states, 20243 states have (on average 1.2109865138566418) internal successors, (24514), 20244 states have internal predecessors, (24514), 0 states have call successors, (0), 0 states 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:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20245 states to 20245 states and 24514 transitions. [2023-12-21 23:41:49,541 INFO L78 Accepts]: Start accepts. Automaton has 20245 states and 24514 transitions. Word has length 133 [2023-12-21 23:41:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:41:49,542 INFO L495 AbstractCegarLoop]: Abstraction has 20245 states and 24514 transitions. [2023-12-21 23:41:49,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states 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:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand 20245 states and 24514 transitions. [2023-12-21 23:41:49,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-21 23:41:49,544 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:41:49,545 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:41:49,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-12-21 23:41:49,747 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:41:49,747 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:41:49,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:41:49,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1010440518, now seen corresponding path program 1 times [2023-12-21 23:41:49,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:41:49,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151739441] [2023-12-21 23:41:49,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:41:49,748 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:49,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:41:49,749 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:41:49,750 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:41:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:41:49,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 23:41:49,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:41:50,038 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:41:50,038 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:41:50,277 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:41:50,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:41:50,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151739441] [2023-12-21 23:41:50,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151739441] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:41:50,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:41:50,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-21 23:41:50,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875151952] [2023-12-21 23:41:50,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:41:50,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 23:41:50,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:41:50,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 23:41:50,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-21 23:41:50,279 INFO L87 Difference]: Start difference. First operand 20245 states and 24514 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:41:53,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:41:53,571 INFO L93 Difference]: Finished difference Result 78308 states and 95122 transitions. [2023-12-21 23:41:53,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 23:41:53,571 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:41:53,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:41:53,635 INFO L225 Difference]: With dead ends: 78308 [2023-12-21 23:41:53,635 INFO L226 Difference]: Without dead ends: 60951 [2023-12-21 23:41:53,647 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:41:53,648 INFO L413 NwaCegarLoop]: 1560 mSDtfsCounter, 3123 mSDsluCounter, 6345 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3123 SdHoareTripleChecker+Valid, 7905 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:41:53,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3123 Valid, 7905 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 23:41:53,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60951 states. [2023-12-21 23:41:57,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60951 to 59946. [2023-12-21 23:41:57,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59946 states, 59944 states have (on average 1.1541271853730148) internal successors, (69183), 59945 states have internal predecessors, (69183), 0 states have call successors, (0), 0 states 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:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59946 states to 59946 states and 69183 transitions. [2023-12-21 23:41:57,363 INFO L78 Accepts]: Start accepts. Automaton has 59946 states and 69183 transitions. Word has length 134 [2023-12-21 23:41:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:41:57,364 INFO L495 AbstractCegarLoop]: Abstraction has 59946 states and 69183 transitions. [2023-12-21 23:41:57,364 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:41:57,364 INFO L276 IsEmpty]: Start isEmpty. Operand 59946 states and 69183 transitions. [2023-12-21 23:41:57,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-21 23:41:57,366 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:41:57,366 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:41:57,370 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:41:57,570 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:41:57,570 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:41:57,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:41:57,570 INFO L85 PathProgramCache]: Analyzing trace with hash 878356736, now seen corresponding path program 1 times [2023-12-21 23:41:57,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:41:57,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51227913] [2023-12-21 23:41:57,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:41:57,571 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:57,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:41:57,572 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 23:41:57,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-12-21 23:41:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 23:41:57,662 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 23:41:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 23:41:57,819 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-21 23:41:57,820 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 23:41:57,820 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-21 23:41:57,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-21 23:41:57,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2023-12-21 23:41:58,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:41:58,028 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:41:58,031 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 23:41:58,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 11:41:58 BoogieIcfgContainer [2023-12-21 23:41:58,156 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 23:41:58,156 INFO L158 Benchmark]: Toolchain (without parser) took 317193.69ms. Allocated memory was 227.5MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 162.5MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 707.9MB. Max. memory is 8.0GB. [2023-12-21 23:41:58,156 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 181.4MB. Free memory was 132.7MB in the beginning and 132.6MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 23:41:58,157 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1343.16ms. Allocated memory is still 227.5MB. Free memory was 162.2MB in the beginning and 159.7MB in the end (delta: 2.5MB). Peak memory consumption was 81.0MB. Max. memory is 8.0GB. [2023-12-21 23:41:58,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 122.17ms. Allocated memory is still 227.5MB. Free memory was 159.2MB in the beginning and 124.0MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-12-21 23:41:58,159 INFO L158 Benchmark]: Boogie Preprocessor took 247.33ms. Allocated memory is still 227.5MB. Free memory was 124.0MB in the beginning and 85.8MB in the end (delta: 38.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2023-12-21 23:41:58,159 INFO L158 Benchmark]: RCFGBuilder took 24322.20ms. Allocated memory was 227.5MB in the beginning and 555.7MB in the end (delta: 328.2MB). Free memory was 85.8MB in the beginning and 310.7MB in the end (delta: -224.9MB). Peak memory consumption was 161.5MB. Max. memory is 8.0GB. [2023-12-21 23:41:58,162 INFO L158 Benchmark]: TraceAbstraction took 291153.29ms. Allocated memory was 555.7MB in the beginning and 2.3GB in the end (delta: 1.8GB). Free memory was 310.2MB in the beginning and 1.5GB in the end (delta: -1.2GB). Peak memory consumption was 525.8MB. Max. memory is 8.0GB. [2023-12-21 23:41:58,164 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.40ms. Allocated memory is still 181.4MB. Free memory was 132.7MB in the beginning and 132.6MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1343.16ms. Allocated memory is still 227.5MB. Free memory was 162.2MB in the beginning and 159.7MB in the end (delta: 2.5MB). Peak memory consumption was 81.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 122.17ms. Allocated memory is still 227.5MB. Free memory was 159.2MB in the beginning and 124.0MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 247.33ms. Allocated memory is still 227.5MB. Free memory was 124.0MB in the beginning and 85.8MB in the end (delta: 38.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * RCFGBuilder took 24322.20ms. Allocated memory was 227.5MB in the beginning and 555.7MB in the end (delta: 328.2MB). Free memory was 85.8MB in the beginning and 310.7MB in the end (delta: -224.9MB). Peak memory consumption was 161.5MB. Max. memory is 8.0GB. * TraceAbstraction took 291153.29ms. Allocated memory was 555.7MB in the beginning and 2.3GB in the end (delta: 1.8GB). Free memory was 310.2MB in the beginning and 1.5GB in the end (delta: -1.2GB). Peak memory consumption was 525.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: 496]: 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: 291.0s, OverallIterations: 32, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 242.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 191032 SdHoareTripleChecker+Valid, 96.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191032 mSDsluCounter, 270381 SdHoareTripleChecker+Invalid, 83.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 224639 mSDsCounter, 1516 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24966 IncrementalHoareTripleChecker+Invalid, 26482 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1516 mSolverCounterUnsat, 45742 mSDtfsCounter, 24966 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4841 GetRequests, 3520 SyntacticMatches, 1 SemanticMatches, 1320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74950 ImplicationChecksByTransitivity, 144.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59946occurred in iteration=31, InterpolantAutomatonStates: 1092, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 15807 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 30.0s InterpolantComputationTime, 2591 NumberOfCodeBlocks, 2327 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3883 ConstructedInterpolants, 807 QuantifiedInterpolants, 48232 SizeOfPredicates, 136 NumberOfNonLiveVariables, 5343 ConjunctsInSsa, 265 ConjunctsInUnsatCore, 46 InterpolantComputations, 16 PerfectInterpolantSequences, 2390/4270 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:41:58,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...