/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/systemc/token_ring.03.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 07:15:47,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 07:15:47,694 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 07:15:47,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 07:15:47,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 07:15:47,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 07:15:47,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 07:15:47,722 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 07:15:47,722 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 07:15:47,725 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 07:15:47,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 07:15:47,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 07:15:47,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 07:15:47,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 07:15:47,728 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 07:15:47,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 07:15:47,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 07:15:47,728 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 07:15:47,729 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 07:15:47,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 07:15:47,729 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 07:15:47,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 07:15:47,729 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 07:15:47,729 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 07:15:47,730 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 07:15:47,730 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 07:15:47,730 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 07:15:47,730 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 07:15:47,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 07:15:47,730 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 07:15:47,731 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 07:15:47,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 07:15:47,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 07:15:47,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 07:15:47,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:15:47,732 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 07:15:47,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 07:15:47,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 07:15:47,732 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 07:15:47,733 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 07:15:47,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 07:15:47,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 07:15:47,733 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 07:15:47,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 07:15:47,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 07:15:47,733 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 07:15:47,734 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 07:15:47,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 07:15:47,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 07:15:47,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 07:15:47,960 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 07:15:47,960 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 07:15:47,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.03.cil-1.c [2023-12-25 07:15:49,079 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 07:15:49,225 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 07:15:49,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.03.cil-1.c [2023-12-25 07:15:49,242 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c66c75a92/3fd79d1bab1d4ffda31724b56c567c67/FLAGc4c8bf074 [2023-12-25 07:15:49,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c66c75a92/3fd79d1bab1d4ffda31724b56c567c67 [2023-12-25 07:15:49,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 07:15:49,257 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 07:15:49,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 07:15:49,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 07:15:49,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 07:15:49,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:15:49" (1/1) ... [2023-12-25 07:15:49,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ffa23ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:15:49, skipping insertion in model container [2023-12-25 07:15:49,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:15:49" (1/1) ... [2023-12-25 07:15:49,302 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 07:15:49,424 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.03.cil-1.c[671,684] [2023-12-25 07:15:49,479 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:15:49,502 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 07:15:49,514 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.03.cil-1.c[671,684] [2023-12-25 07:15:49,555 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:15:49,578 INFO L206 MainTranslator]: Completed translation [2023-12-25 07:15:49,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:15:49 WrapperNode [2023-12-25 07:15:49,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 07:15:49,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 07:15:49,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 07:15:49,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 07:15:49,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:15:49" (1/1) ... [2023-12-25 07:15:49,603 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:15:49" (1/1) ... [2023-12-25 07:15:49,627 INFO L138 Inliner]: procedures = 34, calls = 41, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 331 [2023-12-25 07:15:49,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 07:15:49,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 07:15:49,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 07:15:49,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 07:15:49,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:15:49" (1/1) ... [2023-12-25 07:15:49,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:15:49" (1/1) ... [2023-12-25 07:15:49,639 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:15:49" (1/1) ... [2023-12-25 07:15:49,660 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 07:15:49,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:15:49" (1/1) ... [2023-12-25 07:15:49,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:15:49" (1/1) ... [2023-12-25 07:15:49,671 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:15:49" (1/1) ... [2023-12-25 07:15:49,676 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:15:49" (1/1) ... [2023-12-25 07:15:49,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:15:49" (1/1) ... [2023-12-25 07:15:49,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:15:49" (1/1) ... [2023-12-25 07:15:49,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 07:15:49,681 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 07:15:49,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 07:15:49,681 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 07:15:49,682 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:15:49" (1/1) ... [2023-12-25 07:15:49,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:15:49,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 07:15:49,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 07:15:49,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 07:15:49,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 07:15:49,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 07:15:49,734 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-25 07:15:49,735 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-25 07:15:49,735 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-25 07:15:49,736 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-25 07:15:49,736 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-25 07:15:49,736 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-25 07:15:49,736 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-25 07:15:49,736 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-25 07:15:49,737 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-25 07:15:49,737 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-25 07:15:49,737 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-25 07:15:49,737 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-25 07:15:49,737 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-25 07:15:49,737 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-25 07:15:49,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 07:15:49,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 07:15:49,799 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 07:15:49,801 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 07:15:50,170 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 07:15:50,258 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 07:15:50,259 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-25 07:15:50,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:15:50 BoogieIcfgContainer [2023-12-25 07:15:50,259 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 07:15:50,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 07:15:50,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 07:15:50,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 07:15:50,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 07:15:49" (1/3) ... [2023-12-25 07:15:50,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467c9cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:15:50, skipping insertion in model container [2023-12-25 07:15:50,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:15:49" (2/3) ... [2023-12-25 07:15:50,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467c9cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:15:50, skipping insertion in model container [2023-12-25 07:15:50,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:15:50" (3/3) ... [2023-12-25 07:15:50,265 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.c [2023-12-25 07:15:50,277 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 07:15:50,278 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 07:15:50,326 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 07:15:50,331 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;@4245df13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 07:15:50,331 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 07:15:50,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 121 states have (on average 1.6859504132231404) internal successors, (204), 125 states have internal predecessors, (204), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-25 07:15:50,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 07:15:50,343 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:15:50,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:15:50,344 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:15:50,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:15:50,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1762745251, now seen corresponding path program 1 times [2023-12-25 07:15:50,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:15:50,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056013927] [2023-12-25 07:15:50,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:15:50,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:50,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:15:50,364 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:15:50,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 07:15:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:15:50,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:15:50,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:15:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:15:50,543 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:15:50,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:15:50,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056013927] [2023-12-25 07:15:50,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056013927] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:15:50,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:15:50,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:15:50,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027423432] [2023-12-25 07:15:50,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:15:50,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:15:50,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:15:50,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:15:50,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:15:50,588 INFO L87 Difference]: Start difference. First operand has 149 states, 121 states have (on average 1.6859504132231404) internal successors, (204), 125 states have internal predecessors, (204), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:50,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:15:50,679 INFO L93 Difference]: Finished difference Result 291 states and 474 transitions. [2023-12-25 07:15:50,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:15:50,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-25 07:15:50,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:15:50,693 INFO L225 Difference]: With dead ends: 291 [2023-12-25 07:15:50,693 INFO L226 Difference]: Without dead ends: 146 [2023-12-25 07:15:50,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:15:50,702 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 219 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:15:50,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 208 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:15:50,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-25 07:15:50,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2023-12-25 07:15:50,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 120 states have (on average 1.5666666666666667) internal successors, (188), 122 states have internal predecessors, (188), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-25 07:15:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2023-12-25 07:15:50,754 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 71 [2023-12-25 07:15:50,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:15:50,755 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2023-12-25 07:15:50,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:50,756 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2023-12-25 07:15:50,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 07:15:50,758 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:15:50,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:15:50,764 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-25 07:15:50,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:50,961 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:15:50,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:15:50,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1817138149, now seen corresponding path program 1 times [2023-12-25 07:15:50,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:15:50,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531396941] [2023-12-25 07:15:50,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:15:50,963 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:50,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:15:50,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:15:50,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 07:15:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:15:51,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:15:51,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:15:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:15:51,186 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:15:51,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:15:51,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531396941] [2023-12-25 07:15:51,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531396941] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:15:51,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:15:51,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:15:51,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359243012] [2023-12-25 07:15:51,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:15:51,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:15:51,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:15:51,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:15:51,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:15:51,193 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:51,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:15:51,518 INFO L93 Difference]: Finished difference Result 433 states and 671 transitions. [2023-12-25 07:15:51,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 07:15:51,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-25 07:15:51,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:15:51,522 INFO L225 Difference]: With dead ends: 433 [2023-12-25 07:15:51,522 INFO L226 Difference]: Without dead ends: 296 [2023-12-25 07:15:51,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:15:51,524 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 378 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:15:51,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 559 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 07:15:51,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-12-25 07:15:51,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 283. [2023-12-25 07:15:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 238 states have (on average 1.5756302521008403) internal successors, (375), 241 states have internal predecessors, (375), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2023-12-25 07:15:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 436 transitions. [2023-12-25 07:15:51,560 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 436 transitions. Word has length 71 [2023-12-25 07:15:51,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:15:51,560 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 436 transitions. [2023-12-25 07:15:51,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:51,560 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 436 transitions. [2023-12-25 07:15:51,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 07:15:51,565 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:15:51,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:15:51,600 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-25 07:15:51,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:51,781 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:15:51,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:15:51,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2081001697, now seen corresponding path program 1 times [2023-12-25 07:15:51,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:15:51,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498801025] [2023-12-25 07:15:51,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:15:51,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:51,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:15:51,790 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:15:51,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 07:15:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:15:51,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:15:51,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:15:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:15:51,903 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:15:51,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:15:51,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498801025] [2023-12-25 07:15:51,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [498801025] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:15:51,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:15:51,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:15:51,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376124279] [2023-12-25 07:15:51,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:15:51,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:15:51,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:15:51,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:15:51,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:15:51,904 INFO L87 Difference]: Start difference. First operand 283 states and 436 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:52,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:15:52,096 INFO L93 Difference]: Finished difference Result 557 states and 865 transitions. [2023-12-25 07:15:52,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:15:52,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-25 07:15:52,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:15:52,098 INFO L225 Difference]: With dead ends: 557 [2023-12-25 07:15:52,098 INFO L226 Difference]: Without dead ends: 283 [2023-12-25 07:15:52,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:15:52,099 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 274 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:15:52,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 351 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:15:52,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-12-25 07:15:52,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2023-12-25 07:15:52,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 238 states have (on average 1.546218487394958) internal successors, (368), 241 states have internal predecessors, (368), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2023-12-25 07:15:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 429 transitions. [2023-12-25 07:15:52,118 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 429 transitions. Word has length 71 [2023-12-25 07:15:52,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:15:52,118 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 429 transitions. [2023-12-25 07:15:52,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:52,118 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 429 transitions. [2023-12-25 07:15:52,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 07:15:52,119 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:15:52,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:15:52,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 07:15:52,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:52,331 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:15:52,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:15:52,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1914250019, now seen corresponding path program 1 times [2023-12-25 07:15:52,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:15:52,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131903218] [2023-12-25 07:15:52,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:15:52,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:52,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:15:52,333 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:15:52,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 07:15:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:15:52,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:15:52,406 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:15:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:15:52,445 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:15:52,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:15:52,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131903218] [2023-12-25 07:15:52,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131903218] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:15:52,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:15:52,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:15:52,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035490413] [2023-12-25 07:15:52,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:15:52,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:15:52,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:15:52,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:15:52,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:15:52,453 INFO L87 Difference]: Start difference. First operand 283 states and 429 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:52,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:15:52,659 INFO L93 Difference]: Finished difference Result 557 states and 851 transitions. [2023-12-25 07:15:52,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:15:52,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-25 07:15:52,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:15:52,662 INFO L225 Difference]: With dead ends: 557 [2023-12-25 07:15:52,662 INFO L226 Difference]: Without dead ends: 283 [2023-12-25 07:15:52,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:15:52,667 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 268 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:15:52,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 344 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:15:52,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-12-25 07:15:52,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2023-12-25 07:15:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 238 states have (on average 1.5168067226890756) internal successors, (361), 241 states have internal predecessors, (361), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2023-12-25 07:15:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 422 transitions. [2023-12-25 07:15:52,697 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 422 transitions. Word has length 71 [2023-12-25 07:15:52,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:15:52,697 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 422 transitions. [2023-12-25 07:15:52,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:52,698 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 422 transitions. [2023-12-25 07:15:52,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 07:15:52,699 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:15:52,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:15:52,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 07:15:52,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:52,920 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:15:52,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:15:52,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1836196193, now seen corresponding path program 1 times [2023-12-25 07:15:52,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:15:52,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063840154] [2023-12-25 07:15:52,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:15:52,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:52,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:15:52,922 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:15:52,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 07:15:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:15:53,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:15:53,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:15:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:15:53,045 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:15:53,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:15:53,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063840154] [2023-12-25 07:15:53,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063840154] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:15:53,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:15:53,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:15:53,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298249253] [2023-12-25 07:15:53,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:15:53,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:15:53,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:15:53,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:15:53,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:15:53,047 INFO L87 Difference]: Start difference. First operand 283 states and 422 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:53,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:15:53,276 INFO L93 Difference]: Finished difference Result 615 states and 929 transitions. [2023-12-25 07:15:53,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:15:53,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-25 07:15:53,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:15:53,282 INFO L225 Difference]: With dead ends: 615 [2023-12-25 07:15:53,283 INFO L226 Difference]: Without dead ends: 341 [2023-12-25 07:15:53,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:15:53,284 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 295 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:15:53,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 338 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:15:53,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2023-12-25 07:15:53,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2023-12-25 07:15:53,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 290 states have (on average 1.4758620689655173) internal successors, (428), 293 states have internal predecessors, (428), 33 states have call successors, (33), 17 states have call predecessors, (33), 17 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2023-12-25 07:15:53,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 493 transitions. [2023-12-25 07:15:53,308 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 493 transitions. Word has length 71 [2023-12-25 07:15:53,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:15:53,308 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 493 transitions. [2023-12-25 07:15:53,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:53,309 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 493 transitions. [2023-12-25 07:15:53,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 07:15:53,311 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:15:53,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:15:53,313 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 (6)] Ended with exit code 0 [2023-12-25 07:15:53,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:53,513 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:15:53,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:15:53,514 INFO L85 PathProgramCache]: Analyzing trace with hash -766406916, now seen corresponding path program 1 times [2023-12-25 07:15:53,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:15:53,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228725262] [2023-12-25 07:15:53,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:15:53,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:53,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:15:53,515 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:15:53,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 07:15:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:15:53,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:15:53,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:15:53,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:15:53,611 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:15:53,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:15:53,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228725262] [2023-12-25 07:15:53,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228725262] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:15:53,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:15:53,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:15:53,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54333896] [2023-12-25 07:15:53,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:15:53,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:15:53,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:15:53,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:15:53,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:15:53,612 INFO L87 Difference]: Start difference. First operand 341 states and 493 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:53,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:15:53,828 INFO L93 Difference]: Finished difference Result 731 states and 1071 transitions. [2023-12-25 07:15:53,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:15:53,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-25 07:15:53,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:15:53,831 INFO L225 Difference]: With dead ends: 731 [2023-12-25 07:15:53,831 INFO L226 Difference]: Without dead ends: 399 [2023-12-25 07:15:53,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:15:53,832 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 288 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:15:53,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 331 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:15:53,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2023-12-25 07:15:53,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2023-12-25 07:15:53,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 342 states have (on average 1.435672514619883) internal successors, (491), 345 states have internal predecessors, (491), 35 states have call successors, (35), 21 states have call predecessors, (35), 21 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2023-12-25 07:15:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 560 transitions. [2023-12-25 07:15:53,879 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 560 transitions. Word has length 71 [2023-12-25 07:15:53,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:15:53,879 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 560 transitions. [2023-12-25 07:15:53,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:53,880 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 560 transitions. [2023-12-25 07:15:53,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 07:15:53,880 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:15:53,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:15:53,883 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 (7)] Ended with exit code 0 [2023-12-25 07:15:54,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:54,083 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:15:54,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:15:54,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1043080320, now seen corresponding path program 1 times [2023-12-25 07:15:54,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:15:54,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997925271] [2023-12-25 07:15:54,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:15:54,084 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:54,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:15:54,085 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:15:54,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 07:15:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:15:54,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:15:54,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:15:54,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:15:54,169 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:15:54,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:15:54,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997925271] [2023-12-25 07:15:54,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997925271] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:15:54,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:15:54,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:15:54,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755346572] [2023-12-25 07:15:54,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:15:54,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:15:54,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:15:54,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:15:54,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:15:54,171 INFO L87 Difference]: Start difference. First operand 399 states and 560 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:54,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:15:54,386 INFO L93 Difference]: Finished difference Result 847 states and 1205 transitions. [2023-12-25 07:15:54,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:15:54,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-25 07:15:54,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:15:54,388 INFO L225 Difference]: With dead ends: 847 [2023-12-25 07:15:54,389 INFO L226 Difference]: Without dead ends: 457 [2023-12-25 07:15:54,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:15:54,390 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 282 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:15:54,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 324 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:15:54,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2023-12-25 07:15:54,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2023-12-25 07:15:54,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 394 states have (on average 1.3959390862944163) internal successors, (550), 397 states have internal predecessors, (550), 37 states have call successors, (37), 25 states have call predecessors, (37), 25 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2023-12-25 07:15:54,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 623 transitions. [2023-12-25 07:15:54,411 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 623 transitions. Word has length 71 [2023-12-25 07:15:54,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:15:54,411 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 623 transitions. [2023-12-25 07:15:54,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:54,412 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 623 transitions. [2023-12-25 07:15:54,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 07:15:54,412 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:15:54,412 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:15:54,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 07:15:54,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:54,616 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:15:54,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:15:54,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1852547299, now seen corresponding path program 1 times [2023-12-25 07:15:54,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:15:54,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584731845] [2023-12-25 07:15:54,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:15:54,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:54,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:15:54,617 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:15:54,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 07:15:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:15:54,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:15:54,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:15:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:15:54,696 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:15:54,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:15:54,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584731845] [2023-12-25 07:15:54,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584731845] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:15:54,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:15:54,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:15:54,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712128408] [2023-12-25 07:15:54,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:15:54,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:15:54,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:15:54,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:15:54,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:15:54,698 INFO L87 Difference]: Start difference. First operand 457 states and 623 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:54,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:15:54,921 INFO L93 Difference]: Finished difference Result 957 states and 1323 transitions. [2023-12-25 07:15:54,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:15:54,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-25 07:15:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:15:54,934 INFO L225 Difference]: With dead ends: 957 [2023-12-25 07:15:54,934 INFO L226 Difference]: Without dead ends: 509 [2023-12-25 07:15:54,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:15:54,936 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 275 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:15:54,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 317 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:15:54,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2023-12-25 07:15:54,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2023-12-25 07:15:54,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 444 states have (on average 1.3581081081081081) internal successors, (603), 447 states have internal predecessors, (603), 37 states have call successors, (37), 27 states have call predecessors, (37), 27 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2023-12-25 07:15:54,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 676 transitions. [2023-12-25 07:15:54,958 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 676 transitions. Word has length 71 [2023-12-25 07:15:54,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:15:54,959 INFO L495 AbstractCegarLoop]: Abstraction has 509 states and 676 transitions. [2023-12-25 07:15:54,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:54,959 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 676 transitions. [2023-12-25 07:15:54,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 07:15:54,959 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:15:54,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:15:54,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-25 07:15:55,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:55,162 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:15:55,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:15:55,163 INFO L85 PathProgramCache]: Analyzing trace with hash -379180830, now seen corresponding path program 1 times [2023-12-25 07:15:55,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:15:55,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201177780] [2023-12-25 07:15:55,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:15:55,163 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:55,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:15:55,188 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:15:55,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 07:15:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:15:55,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:15:55,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:15:55,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:15:55,290 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:15:55,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:15:55,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [201177780] [2023-12-25 07:15:55,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [201177780] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:15:55,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:15:55,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:15:55,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349785343] [2023-12-25 07:15:55,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:15:55,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:15:55,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:15:55,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:15:55,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:15:55,292 INFO L87 Difference]: Start difference. First operand 509 states and 676 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:55,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:15:55,350 INFO L93 Difference]: Finished difference Result 1052 states and 1414 transitions. [2023-12-25 07:15:55,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:15:55,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-25 07:15:55,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:15:55,353 INFO L225 Difference]: With dead ends: 1052 [2023-12-25 07:15:55,353 INFO L226 Difference]: Without dead ends: 553 [2023-12-25 07:15:55,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:15:55,356 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 29 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:15:55,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 559 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:15:55,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2023-12-25 07:15:55,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 513. [2023-12-25 07:15:55,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 448 states have (on average 1.3370535714285714) internal successors, (599), 451 states have internal predecessors, (599), 37 states have call successors, (37), 27 states have call predecessors, (37), 27 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2023-12-25 07:15:55,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 672 transitions. [2023-12-25 07:15:55,381 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 672 transitions. Word has length 71 [2023-12-25 07:15:55,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:15:55,382 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 672 transitions. [2023-12-25 07:15:55,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:55,382 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 672 transitions. [2023-12-25 07:15:55,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 07:15:55,383 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:15:55,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:15:55,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 07:15:55,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:55,586 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:15:55,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:15:55,587 INFO L85 PathProgramCache]: Analyzing trace with hash 514305508, now seen corresponding path program 1 times [2023-12-25 07:15:55,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:15:55,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533349529] [2023-12-25 07:15:55,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:15:55,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:55,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:15:55,588 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:15:55,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 07:15:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:15:55,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:15:55,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:15:55,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:15:55,652 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:15:55,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:15:55,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533349529] [2023-12-25 07:15:55,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533349529] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:15:55,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:15:55,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:15:55,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550583452] [2023-12-25 07:15:55,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:15:55,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:15:55,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:15:55,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:15:55,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:15:55,654 INFO L87 Difference]: Start difference. First operand 513 states and 672 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:55,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:15:55,708 INFO L93 Difference]: Finished difference Result 1048 states and 1390 transitions. [2023-12-25 07:15:55,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:15:55,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-25 07:15:55,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:15:55,710 INFO L225 Difference]: With dead ends: 1048 [2023-12-25 07:15:55,710 INFO L226 Difference]: Without dead ends: 545 [2023-12-25 07:15:55,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:15:55,712 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 20 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:15:55,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 560 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:15:55,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2023-12-25 07:15:55,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 517. [2023-12-25 07:15:55,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 452 states have (on average 1.3163716814159292) internal successors, (595), 455 states have internal predecessors, (595), 37 states have call successors, (37), 27 states have call predecessors, (37), 27 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2023-12-25 07:15:55,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 668 transitions. [2023-12-25 07:15:55,757 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 668 transitions. Word has length 71 [2023-12-25 07:15:55,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:15:55,757 INFO L495 AbstractCegarLoop]: Abstraction has 517 states and 668 transitions. [2023-12-25 07:15:55,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:55,757 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 668 transitions. [2023-12-25 07:15:55,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 07:15:55,758 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:15:55,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:15:55,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-25 07:15:55,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:55,961 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:15:55,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:15:55,961 INFO L85 PathProgramCache]: Analyzing trace with hash -857501790, now seen corresponding path program 1 times [2023-12-25 07:15:55,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:15:55,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346880727] [2023-12-25 07:15:55,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:15:55,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:55,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:15:55,962 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:15:55,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 07:15:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:15:56,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:15:56,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:15:56,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:15:56,024 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:15:56,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:15:56,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346880727] [2023-12-25 07:15:56,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346880727] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:15:56,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:15:56,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:15:56,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702027646] [2023-12-25 07:15:56,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:15:56,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:15:56,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:15:56,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:15:56,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:15:56,026 INFO L87 Difference]: Start difference. First operand 517 states and 668 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:56,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:15:56,076 INFO L93 Difference]: Finished difference Result 1044 states and 1366 transitions. [2023-12-25 07:15:56,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:15:56,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-25 07:15:56,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:15:56,078 INFO L225 Difference]: With dead ends: 1044 [2023-12-25 07:15:56,078 INFO L226 Difference]: Without dead ends: 537 [2023-12-25 07:15:56,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:15:56,080 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 11 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:15:56,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 561 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:15:56,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2023-12-25 07:15:56,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 521. [2023-12-25 07:15:56,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 456 states have (on average 1.2960526315789473) internal successors, (591), 459 states have internal predecessors, (591), 37 states have call successors, (37), 27 states have call predecessors, (37), 27 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2023-12-25 07:15:56,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 664 transitions. [2023-12-25 07:15:56,100 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 664 transitions. Word has length 71 [2023-12-25 07:15:56,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:15:56,100 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 664 transitions. [2023-12-25 07:15:56,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:56,101 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 664 transitions. [2023-12-25 07:15:56,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 07:15:56,101 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:15:56,101 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:15:56,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-25 07:15:56,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:56,304 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:15:56,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:15:56,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1701507292, now seen corresponding path program 1 times [2023-12-25 07:15:56,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:15:56,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397191396] [2023-12-25 07:15:56,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:15:56,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:56,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:15:56,306 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:15:56,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 07:15:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:15:56,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:15:56,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:15:56,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:15:56,377 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:15:56,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:15:56,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397191396] [2023-12-25 07:15:56,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397191396] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:15:56,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:15:56,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:15:56,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297798978] [2023-12-25 07:15:56,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:15:56,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:15:56,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:15:56,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:15:56,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:15:56,378 INFO L87 Difference]: Start difference. First operand 521 states and 664 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:56,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:15:56,430 INFO L93 Difference]: Finished difference Result 1040 states and 1342 transitions. [2023-12-25 07:15:56,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:15:56,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-25 07:15:56,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:15:56,432 INFO L225 Difference]: With dead ends: 1040 [2023-12-25 07:15:56,432 INFO L226 Difference]: Without dead ends: 529 [2023-12-25 07:15:56,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:15:56,434 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 2 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:15:56,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 562 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:15:56,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2023-12-25 07:15:56,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 525. [2023-12-25 07:15:56,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 460 states have (on average 1.2760869565217392) internal successors, (587), 463 states have internal predecessors, (587), 37 states have call successors, (37), 27 states have call predecessors, (37), 27 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2023-12-25 07:15:56,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 660 transitions. [2023-12-25 07:15:56,471 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 660 transitions. Word has length 71 [2023-12-25 07:15:56,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:15:56,471 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 660 transitions. [2023-12-25 07:15:56,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:56,472 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 660 transitions. [2023-12-25 07:15:56,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 07:15:56,472 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:15:56,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:15:56,477 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-25 07:15:56,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:56,675 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:15:56,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:15:56,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1678875038, now seen corresponding path program 1 times [2023-12-25 07:15:56,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:15:56,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040609028] [2023-12-25 07:15:56,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:15:56,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:56,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:15:56,677 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:15:56,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-25 07:15:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:15:56,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 07:15:56,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:15:56,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:15:56,795 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:15:56,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:15:56,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040609028] [2023-12-25 07:15:56,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040609028] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:15:56,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:15:56,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:15:56,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861787777] [2023-12-25 07:15:56,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:15:56,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:15:56,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:15:56,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:15:56,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:15:56,797 INFO L87 Difference]: Start difference. First operand 525 states and 660 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:56,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:15:56,963 INFO L93 Difference]: Finished difference Result 1041 states and 1313 transitions. [2023-12-25 07:15:56,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:15:56,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-25 07:15:56,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:15:56,965 INFO L225 Difference]: With dead ends: 1041 [2023-12-25 07:15:56,965 INFO L226 Difference]: Without dead ends: 525 [2023-12-25 07:15:56,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:15:56,967 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 214 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:15:56,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 309 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:15:56,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2023-12-25 07:15:56,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2023-12-25 07:15:56,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 460 states have (on average 1.2608695652173914) internal successors, (580), 463 states have internal predecessors, (580), 37 states have call successors, (37), 27 states have call predecessors, (37), 27 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2023-12-25 07:15:56,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 653 transitions. [2023-12-25 07:15:56,990 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 653 transitions. Word has length 71 [2023-12-25 07:15:56,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:15:56,990 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 653 transitions. [2023-12-25 07:15:56,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 07:15:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 653 transitions. [2023-12-25 07:15:56,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 07:15:56,991 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:15:56,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:15:57,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-25 07:15:57,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:57,194 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:15:57,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:15:57,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1538326428, now seen corresponding path program 1 times [2023-12-25 07:15:57,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:15:57,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352154711] [2023-12-25 07:15:57,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:15:57,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:57,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:15:57,196 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:15:57,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-25 07:15:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:15:57,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:15:57,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:15:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:15:57,311 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:15:57,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:15:57,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352154711] [2023-12-25 07:15:57,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352154711] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:15:57,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:15:57,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:15:57,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094485177] [2023-12-25 07:15:57,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:15:57,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:15:57,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:15:57,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:15:57,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:15:57,313 INFO L87 Difference]: Start difference. First operand 525 states and 653 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-25 07:15:57,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:15:57,409 INFO L93 Difference]: Finished difference Result 1520 states and 1894 transitions. [2023-12-25 07:15:57,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:15:57,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 71 [2023-12-25 07:15:57,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:15:57,413 INFO L225 Difference]: With dead ends: 1520 [2023-12-25 07:15:57,413 INFO L226 Difference]: Without dead ends: 1005 [2023-12-25 07:15:57,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:15:57,414 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 113 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:15:57,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 382 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:15:57,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2023-12-25 07:15:57,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 1003. [2023-12-25 07:15:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 880 states have (on average 1.2352272727272726) internal successors, (1087), 886 states have internal predecessors, (1087), 68 states have call successors, (68), 53 states have call predecessors, (68), 54 states have return successors, (68), 64 states have call predecessors, (68), 66 states have call successors, (68) [2023-12-25 07:15:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1223 transitions. [2023-12-25 07:15:57,458 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1223 transitions. Word has length 71 [2023-12-25 07:15:57,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:15:57,458 INFO L495 AbstractCegarLoop]: Abstraction has 1003 states and 1223 transitions. [2023-12-25 07:15:57,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-25 07:15:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1223 transitions. [2023-12-25 07:15:57,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-25 07:15:57,459 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:15:57,459 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:15:57,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-25 07:15:57,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:57,662 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:15:57,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:15:57,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1943242203, now seen corresponding path program 1 times [2023-12-25 07:15:57,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:15:57,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615218013] [2023-12-25 07:15:57,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:15:57,663 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:57,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:15:57,664 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:15:57,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-25 07:15:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:15:57,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 07:15:57,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:15:57,822 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 07:15:57,823 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:15:57,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:15:57,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615218013] [2023-12-25 07:15:57,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615218013] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:15:57,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:15:57,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:15:57,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656415281] [2023-12-25 07:15:57,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:15:57,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:15:57,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:15:57,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:15:57,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:15:57,824 INFO L87 Difference]: Start difference. First operand 1003 states and 1223 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 07:15:58,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:15:58,081 INFO L93 Difference]: Finished difference Result 2899 states and 3539 transitions. [2023-12-25 07:15:58,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:15:58,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 115 [2023-12-25 07:15:58,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:15:58,088 INFO L225 Difference]: With dead ends: 2899 [2023-12-25 07:15:58,088 INFO L226 Difference]: Without dead ends: 1907 [2023-12-25 07:15:58,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:15:58,090 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 224 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:15:58,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 495 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:15:58,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2023-12-25 07:15:58,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1903. [2023-12-25 07:15:58,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1903 states, 1669 states have (on average 1.2216896345116837) internal successors, (2039), 1684 states have internal predecessors, (2039), 125 states have call successors, (125), 97 states have call predecessors, (125), 108 states have return successors, (147), 123 states have call predecessors, (147), 123 states have call successors, (147) [2023-12-25 07:15:58,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 2311 transitions. [2023-12-25 07:15:58,187 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 2311 transitions. Word has length 115 [2023-12-25 07:15:58,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:15:58,187 INFO L495 AbstractCegarLoop]: Abstraction has 1903 states and 2311 transitions. [2023-12-25 07:15:58,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 07:15:58,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2311 transitions. [2023-12-25 07:15:58,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-25 07:15:58,189 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:15:58,189 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:15:58,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-25 07:15:58,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:58,392 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:15:58,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:15:58,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1313140519, now seen corresponding path program 1 times [2023-12-25 07:15:58,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:15:58,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [613872456] [2023-12-25 07:15:58,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:15:58,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:58,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:15:58,394 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:15:58,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-25 07:15:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:15:58,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:15:58,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:15:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-25 07:15:58,466 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:15:58,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:15:58,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [613872456] [2023-12-25 07:15:58,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [613872456] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:15:58,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:15:58,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:15:58,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776758906] [2023-12-25 07:15:58,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:15:58,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:15:58,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:15:58,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:15:58,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:15:58,468 INFO L87 Difference]: Start difference. First operand 1903 states and 2311 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 07:15:58,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:15:58,546 INFO L93 Difference]: Finished difference Result 3789 states and 4594 transitions. [2023-12-25 07:15:58,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:15:58,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 115 [2023-12-25 07:15:58,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:15:58,552 INFO L225 Difference]: With dead ends: 3789 [2023-12-25 07:15:58,552 INFO L226 Difference]: Without dead ends: 1897 [2023-12-25 07:15:58,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:15:58,556 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 196 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:15:58,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 185 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:15:58,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2023-12-25 07:15:58,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1897. [2023-12-25 07:15:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1666 states have (on average 1.2208883553421368) internal successors, (2034), 1680 states have internal predecessors, (2034), 122 states have call successors, (122), 97 states have call predecessors, (122), 108 states have return successors, (144), 120 states have call predecessors, (144), 120 states have call successors, (144) [2023-12-25 07:15:58,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2300 transitions. [2023-12-25 07:15:58,658 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2300 transitions. Word has length 115 [2023-12-25 07:15:58,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:15:58,659 INFO L495 AbstractCegarLoop]: Abstraction has 1897 states and 2300 transitions. [2023-12-25 07:15:58,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 07:15:58,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2300 transitions. [2023-12-25 07:15:58,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-25 07:15:58,661 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:15:58,662 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:15:58,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-25 07:15:58,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:58,865 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:15:58,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:15:58,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1883331254, now seen corresponding path program 1 times [2023-12-25 07:15:58,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:15:58,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172914788] [2023-12-25 07:15:58,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:15:58,866 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:58,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:15:58,867 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:15:58,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-25 07:15:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:15:58,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 07:15:58,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:15:59,034 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 07:15:59,034 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:15:59,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:15:59,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172914788] [2023-12-25 07:15:59,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172914788] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:15:59,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:15:59,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:15:59,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977706501] [2023-12-25 07:15:59,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:15:59,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:15:59,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:15:59,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:15:59,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:15:59,036 INFO L87 Difference]: Start difference. First operand 1897 states and 2300 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 07:15:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:15:59,357 INFO L93 Difference]: Finished difference Result 5405 states and 6558 transitions. [2023-12-25 07:15:59,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:15:59,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 117 [2023-12-25 07:15:59,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:15:59,368 INFO L225 Difference]: With dead ends: 5405 [2023-12-25 07:15:59,369 INFO L226 Difference]: Without dead ends: 3519 [2023-12-25 07:15:59,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:15:59,373 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 226 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:15:59,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 347 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:15:59,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3519 states. [2023-12-25 07:15:59,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3519 to 3515. [2023-12-25 07:15:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3515 states, 3084 states have (on average 1.2120622568093384) internal successors, (3738), 3114 states have internal predecessors, (3738), 222 states have call successors, (222), 177 states have call predecessors, (222), 208 states have return successors, (288), 224 states have call predecessors, (288), 220 states have call successors, (288) [2023-12-25 07:15:59,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 3515 states and 4248 transitions. [2023-12-25 07:15:59,582 INFO L78 Accepts]: Start accepts. Automaton has 3515 states and 4248 transitions. Word has length 117 [2023-12-25 07:15:59,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:15:59,583 INFO L495 AbstractCegarLoop]: Abstraction has 3515 states and 4248 transitions. [2023-12-25 07:15:59,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 07:15:59,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3515 states and 4248 transitions. [2023-12-25 07:15:59,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-25 07:15:59,585 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:15:59,585 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:15:59,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-12-25 07:15:59,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:59,789 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:15:59,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:15:59,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2005480283, now seen corresponding path program 1 times [2023-12-25 07:15:59,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:15:59,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892186524] [2023-12-25 07:15:59,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:15:59,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:15:59,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:15:59,790 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:15:59,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-25 07:15:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:15:59,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 07:15:59,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:15:59,995 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 07:15:59,996 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:15:59,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:15:59,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892186524] [2023-12-25 07:15:59,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892186524] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:15:59,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:15:59,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:15:59,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559108702] [2023-12-25 07:15:59,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:15:59,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:15:59,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:15:59,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:15:59,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:15:59,997 INFO L87 Difference]: Start difference. First operand 3515 states and 4248 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 07:16:00,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:16:00,480 INFO L93 Difference]: Finished difference Result 9975 states and 12069 transitions. [2023-12-25 07:16:00,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:16:00,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 119 [2023-12-25 07:16:00,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:16:00,528 INFO L225 Difference]: With dead ends: 9975 [2023-12-25 07:16:00,528 INFO L226 Difference]: Without dead ends: 6471 [2023-12-25 07:16:00,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:16:00,534 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 212 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:16:00,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 431 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:16:00,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6471 states. [2023-12-25 07:16:00,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6471 to 6467. [2023-12-25 07:16:00,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6467 states, 5657 states have (on average 1.2061163160685875) internal successors, (6823), 5724 states have internal predecessors, (6823), 409 states have call successors, (409), 321 states have call predecessors, (409), 400 states have return successors, (571), 423 states have call predecessors, (571), 407 states have call successors, (571) [2023-12-25 07:16:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6467 states to 6467 states and 7803 transitions. [2023-12-25 07:16:00,859 INFO L78 Accepts]: Start accepts. Automaton has 6467 states and 7803 transitions. Word has length 119 [2023-12-25 07:16:00,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:16:00,860 INFO L495 AbstractCegarLoop]: Abstraction has 6467 states and 7803 transitions. [2023-12-25 07:16:00,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 07:16:00,860 INFO L276 IsEmpty]: Start isEmpty. Operand 6467 states and 7803 transitions. [2023-12-25 07:16:00,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-25 07:16:00,864 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:16:00,864 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:16:00,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-25 07:16:01,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:01,068 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:16:01,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:16:01,068 INFO L85 PathProgramCache]: Analyzing trace with hash 642124071, now seen corresponding path program 1 times [2023-12-25 07:16:01,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:16:01,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670836199] [2023-12-25 07:16:01,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:16:01,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:01,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:16:01,070 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:16:01,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-25 07:16:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:16:01,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:16:01,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:16:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-25 07:16:01,140 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:16:01,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:16:01,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670836199] [2023-12-25 07:16:01,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670836199] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:16:01,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:16:01,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:16:01,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138714906] [2023-12-25 07:16:01,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:16:01,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:16:01,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:16:01,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:16:01,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:01,141 INFO L87 Difference]: Start difference. First operand 6467 states and 7803 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 07:16:01,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:16:01,428 INFO L93 Difference]: Finished difference Result 12919 states and 15582 transitions. [2023-12-25 07:16:01,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:16:01,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 119 [2023-12-25 07:16:01,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:16:01,448 INFO L225 Difference]: With dead ends: 12919 [2023-12-25 07:16:01,448 INFO L226 Difference]: Without dead ends: 6463 [2023-12-25 07:16:01,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:01,457 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 193 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:16:01,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 184 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:16:01,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6463 states. [2023-12-25 07:16:01,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6463 to 6463. [2023-12-25 07:16:01,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6463 states, 5656 states have (on average 1.205975954738331) internal successors, (6821), 5722 states have internal predecessors, (6821), 406 states have call successors, (406), 321 states have call predecessors, (406), 400 states have return successors, (568), 420 states have call predecessors, (568), 404 states have call successors, (568) [2023-12-25 07:16:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6463 states to 6463 states and 7795 transitions. [2023-12-25 07:16:01,856 INFO L78 Accepts]: Start accepts. Automaton has 6463 states and 7795 transitions. Word has length 119 [2023-12-25 07:16:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:16:01,856 INFO L495 AbstractCegarLoop]: Abstraction has 6463 states and 7795 transitions. [2023-12-25 07:16:01,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 07:16:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 6463 states and 7795 transitions. [2023-12-25 07:16:01,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-25 07:16:01,860 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:16:01,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:16:01,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-25 07:16:02,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:02,080 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:16:02,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:16:02,080 INFO L85 PathProgramCache]: Analyzing trace with hash -715697910, now seen corresponding path program 1 times [2023-12-25 07:16:02,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:16:02,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798249045] [2023-12-25 07:16:02,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:16:02,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:02,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:16:02,082 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:16:02,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-25 07:16:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:16:02,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:16:02,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:16:02,181 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 07:16:02,181 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:16:02,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:16:02,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798249045] [2023-12-25 07:16:02,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798249045] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:16:02,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:16:02,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:16:02,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345986792] [2023-12-25 07:16:02,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:16:02,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:16:02,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:16:02,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:16:02,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:02,183 INFO L87 Difference]: Start difference. First operand 6463 states and 7795 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-25 07:16:02,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:16:02,659 INFO L93 Difference]: Finished difference Result 17850 states and 21584 transitions. [2023-12-25 07:16:02,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:16:02,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 121 [2023-12-25 07:16:02,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:16:02,692 INFO L225 Difference]: With dead ends: 17850 [2023-12-25 07:16:02,692 INFO L226 Difference]: Without dead ends: 8963 [2023-12-25 07:16:02,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:02,706 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 147 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:16:02,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 504 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:16:02,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8963 states. [2023-12-25 07:16:03,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8963 to 8963. [2023-12-25 07:16:03,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8963 states, 7836 states have (on average 1.1988259315977539) internal successors, (9394), 7918 states have internal predecessors, (9394), 574 states have call successors, (574), 449 states have call predecessors, (574), 552 states have return successors, (818), 596 states have call predecessors, (818), 572 states have call successors, (818) [2023-12-25 07:16:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8963 states to 8963 states and 10786 transitions. [2023-12-25 07:16:03,183 INFO L78 Accepts]: Start accepts. Automaton has 8963 states and 10786 transitions. Word has length 121 [2023-12-25 07:16:03,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:16:03,183 INFO L495 AbstractCegarLoop]: Abstraction has 8963 states and 10786 transitions. [2023-12-25 07:16:03,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-25 07:16:03,183 INFO L276 IsEmpty]: Start isEmpty. Operand 8963 states and 10786 transitions. [2023-12-25 07:16:03,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-25 07:16:03,189 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:16:03,190 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:16:03,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-25 07:16:03,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:03,393 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:16:03,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:16:03,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1402495310, now seen corresponding path program 1 times [2023-12-25 07:16:03,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:16:03,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618282399] [2023-12-25 07:16:03,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:16:03,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:03,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:16:03,395 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:16:03,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-25 07:16:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:16:03,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:16:03,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:16:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 07:16:03,586 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:16:03,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:16:03,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618282399] [2023-12-25 07:16:03,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618282399] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:16:03,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:16:03,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:16:03,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218991047] [2023-12-25 07:16:03,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:16:03,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:16:03,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:16:03,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:16:03,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:03,587 INFO L87 Difference]: Start difference. First operand 8963 states and 10786 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 07:16:04,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:16:04,219 INFO L93 Difference]: Finished difference Result 20424 states and 24616 transitions. [2023-12-25 07:16:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:16:04,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 152 [2023-12-25 07:16:04,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:16:04,244 INFO L225 Difference]: With dead ends: 20424 [2023-12-25 07:16:04,244 INFO L226 Difference]: Without dead ends: 11471 [2023-12-25 07:16:04,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:04,257 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 82 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:16:04,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 349 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:16:04,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11471 states. [2023-12-25 07:16:04,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11471 to 11447. [2023-12-25 07:16:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11447 states, 10000 states have (on average 1.1878) internal successors, (11878), 10098 states have internal predecessors, (11878), 742 states have call successors, (742), 577 states have call predecessors, (742), 704 states have return successors, (1046), 772 states have call predecessors, (1046), 740 states have call successors, (1046) [2023-12-25 07:16:04,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11447 states to 11447 states and 13666 transitions. [2023-12-25 07:16:04,793 INFO L78 Accepts]: Start accepts. Automaton has 11447 states and 13666 transitions. Word has length 152 [2023-12-25 07:16:04,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:16:04,794 INFO L495 AbstractCegarLoop]: Abstraction has 11447 states and 13666 transitions. [2023-12-25 07:16:04,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 07:16:04,794 INFO L276 IsEmpty]: Start isEmpty. Operand 11447 states and 13666 transitions. [2023-12-25 07:16:04,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-25 07:16:04,802 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:16:04,804 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:16:04,809 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-25 07:16:05,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:05,007 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:16:05,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:16:05,007 INFO L85 PathProgramCache]: Analyzing trace with hash -151887886, now seen corresponding path program 1 times [2023-12-25 07:16:05,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:16:05,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545192778] [2023-12-25 07:16:05,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:16:05,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:05,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:16:05,009 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:16:05,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-25 07:16:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:16:05,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:16:05,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:16:05,173 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-25 07:16:05,174 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:16:05,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:16:05,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545192778] [2023-12-25 07:16:05,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545192778] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:16:05,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:16:05,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:16:05,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642942131] [2023-12-25 07:16:05,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:16:05,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:16:05,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:16:05,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:16:05,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:16:05,175 INFO L87 Difference]: Start difference. First operand 11447 states and 13666 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-25 07:16:05,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:16:05,952 INFO L93 Difference]: Finished difference Result 22989 states and 27517 transitions. [2023-12-25 07:16:05,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:16:05,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 173 [2023-12-25 07:16:05,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:16:05,980 INFO L225 Difference]: With dead ends: 22989 [2023-12-25 07:16:05,980 INFO L226 Difference]: Without dead ends: 11553 [2023-12-25 07:16:05,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:16:05,999 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 217 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:16:05,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 361 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 07:16:06,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11553 states. [2023-12-25 07:16:06,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11553 to 11553. [2023-12-25 07:16:06,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11553 states, 10090 states have (on average 1.177205153617443) internal successors, (11878), 10196 states have internal predecessors, (11878), 742 states have call successors, (742), 577 states have call predecessors, (742), 720 states have return successors, (944), 780 states have call predecessors, (944), 740 states have call successors, (944) [2023-12-25 07:16:06,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11553 states to 11553 states and 13564 transitions. [2023-12-25 07:16:06,730 INFO L78 Accepts]: Start accepts. Automaton has 11553 states and 13564 transitions. Word has length 173 [2023-12-25 07:16:06,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:16:06,731 INFO L495 AbstractCegarLoop]: Abstraction has 11553 states and 13564 transitions. [2023-12-25 07:16:06,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-25 07:16:06,731 INFO L276 IsEmpty]: Start isEmpty. Operand 11553 states and 13564 transitions. [2023-12-25 07:16:06,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-12-25 07:16:06,740 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:16:06,740 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:16:06,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-25 07:16:06,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:06,944 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:16:06,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:16:06,944 INFO L85 PathProgramCache]: Analyzing trace with hash 184147991, now seen corresponding path program 1 times [2023-12-25 07:16:06,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:16:06,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196657512] [2023-12-25 07:16:06,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:16:06,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:06,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:16:06,946 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:16:06,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-25 07:16:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:16:07,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:16:07,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:16:07,074 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 07:16:07,075 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:16:07,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:16:07,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196657512] [2023-12-25 07:16:07,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196657512] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:16:07,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:16:07,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:16:07,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447320433] [2023-12-25 07:16:07,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:16:07,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:16:07,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:16:07,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:16:07,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:07,076 INFO L87 Difference]: Start difference. First operand 11553 states and 13564 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-25 07:16:07,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:16:07,736 INFO L93 Difference]: Finished difference Result 20629 states and 24290 transitions. [2023-12-25 07:16:07,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:16:07,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 174 [2023-12-25 07:16:07,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:16:07,759 INFO L225 Difference]: With dead ends: 20629 [2023-12-25 07:16:07,759 INFO L226 Difference]: Without dead ends: 11557 [2023-12-25 07:16:07,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:07,769 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 152 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:16:07,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 494 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:16:07,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11557 states. [2023-12-25 07:16:08,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11557 to 11553. [2023-12-25 07:16:08,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11553 states, 10090 states have (on average 1.1746283448959365) internal successors, (11852), 10196 states have internal predecessors, (11852), 742 states have call successors, (742), 577 states have call predecessors, (742), 720 states have return successors, (938), 780 states have call predecessors, (938), 740 states have call successors, (938) [2023-12-25 07:16:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11553 states to 11553 states and 13532 transitions. [2023-12-25 07:16:08,378 INFO L78 Accepts]: Start accepts. Automaton has 11553 states and 13532 transitions. Word has length 174 [2023-12-25 07:16:08,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:16:08,378 INFO L495 AbstractCegarLoop]: Abstraction has 11553 states and 13532 transitions. [2023-12-25 07:16:08,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-25 07:16:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 11553 states and 13532 transitions. [2023-12-25 07:16:08,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-12-25 07:16:08,389 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:16:08,389 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:16:08,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-12-25 07:16:08,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:08,593 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:16:08,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:16:08,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1981961244, now seen corresponding path program 1 times [2023-12-25 07:16:08,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:16:08,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127317481] [2023-12-25 07:16:08,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:16:08,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:08,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:16:08,595 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:16:08,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-25 07:16:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:16:08,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:16:08,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:16:08,802 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-12-25 07:16:08,802 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:16:08,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:16:08,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127317481] [2023-12-25 07:16:08,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127317481] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:16:08,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:16:08,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:16:08,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785759247] [2023-12-25 07:16:08,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:16:08,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:16:08,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:16:08,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:16:08,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:08,804 INFO L87 Difference]: Start difference. First operand 11553 states and 13532 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-25 07:16:09,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:16:09,419 INFO L93 Difference]: Finished difference Result 25282 states and 29624 transitions. [2023-12-25 07:16:09,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:16:09,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 205 [2023-12-25 07:16:09,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:16:09,449 INFO L225 Difference]: With dead ends: 25282 [2023-12-25 07:16:09,449 INFO L226 Difference]: Without dead ends: 13739 [2023-12-25 07:16:09,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:09,464 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 64 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:16:09,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 347 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:16:09,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13739 states. [2023-12-25 07:16:10,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13739 to 13707. [2023-12-25 07:16:10,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13707 states, 11964 states have (on average 1.1654964894684052) internal successors, (13944), 12082 states have internal predecessors, (13944), 894 states have call successors, (894), 689 states have call predecessors, (894), 848 states have return successors, (1118), 936 states have call predecessors, (1118), 892 states have call successors, (1118) [2023-12-25 07:16:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13707 states to 13707 states and 15956 transitions. [2023-12-25 07:16:10,117 INFO L78 Accepts]: Start accepts. Automaton has 13707 states and 15956 transitions. Word has length 205 [2023-12-25 07:16:10,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:16:10,117 INFO L495 AbstractCegarLoop]: Abstraction has 13707 states and 15956 transitions. [2023-12-25 07:16:10,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-25 07:16:10,118 INFO L276 IsEmpty]: Start isEmpty. Operand 13707 states and 15956 transitions. [2023-12-25 07:16:10,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2023-12-25 07:16:10,129 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:16:10,129 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:16:10,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-12-25 07:16:10,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:10,333 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:16:10,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:16:10,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1618960972, now seen corresponding path program 1 times [2023-12-25 07:16:10,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:16:10,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650573011] [2023-12-25 07:16:10,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:16:10,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:10,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:16:10,336 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:16:10,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-25 07:16:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:16:10,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:16:10,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:16:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-25 07:16:10,451 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:16:10,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:16:10,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650573011] [2023-12-25 07:16:10,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650573011] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:16:10,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:16:10,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:16:10,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244995497] [2023-12-25 07:16:10,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:16:10,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:16:10,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:16:10,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:16:10,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:10,453 INFO L87 Difference]: Start difference. First operand 13707 states and 15956 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-25 07:16:11,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:16:11,038 INFO L93 Difference]: Finished difference Result 25253 states and 29476 transitions. [2023-12-25 07:16:11,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:16:11,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 208 [2023-12-25 07:16:11,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:16:11,074 INFO L225 Difference]: With dead ends: 25253 [2023-12-25 07:16:11,075 INFO L226 Difference]: Without dead ends: 13711 [2023-12-25 07:16:11,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:11,093 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 149 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:16:11,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 483 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:16:11,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13711 states. [2023-12-25 07:16:11,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13711 to 13707. [2023-12-25 07:16:11,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13707 states, 11964 states have (on average 1.1623202942159814) internal successors, (13906), 12082 states have internal predecessors, (13906), 894 states have call successors, (894), 689 states have call predecessors, (894), 848 states have return successors, (1100), 936 states have call predecessors, (1100), 892 states have call successors, (1100) [2023-12-25 07:16:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13707 states to 13707 states and 15900 transitions. [2023-12-25 07:16:11,926 INFO L78 Accepts]: Start accepts. Automaton has 13707 states and 15900 transitions. Word has length 208 [2023-12-25 07:16:11,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:16:11,926 INFO L495 AbstractCegarLoop]: Abstraction has 13707 states and 15900 transitions. [2023-12-25 07:16:11,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-25 07:16:11,926 INFO L276 IsEmpty]: Start isEmpty. Operand 13707 states and 15900 transitions. [2023-12-25 07:16:11,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-25 07:16:11,939 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:16:11,939 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:16:11,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-12-25 07:16:12,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:12,143 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:16:12,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:16:12,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1809123760, now seen corresponding path program 1 times [2023-12-25 07:16:12,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:16:12,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121325316] [2023-12-25 07:16:12,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:16:12,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:12,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:16:12,145 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:16:12,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-25 07:16:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:16:12,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:16:12,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:16:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-12-25 07:16:12,388 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:16:12,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:16:12,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121325316] [2023-12-25 07:16:12,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121325316] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:16:12,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:16:12,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:16:12,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039202351] [2023-12-25 07:16:12,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:16:12,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:16:12,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:16:12,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:16:12,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:12,391 INFO L87 Difference]: Start difference. First operand 13707 states and 15900 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-25 07:16:13,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:16:13,132 INFO L93 Difference]: Finished difference Result 29268 states and 33916 transitions. [2023-12-25 07:16:13,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:16:13,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 239 [2023-12-25 07:16:13,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:16:13,166 INFO L225 Difference]: With dead ends: 29268 [2023-12-25 07:16:13,166 INFO L226 Difference]: Without dead ends: 15571 [2023-12-25 07:16:13,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:13,182 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 51 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:16:13,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 383 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:16:13,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15571 states. [2023-12-25 07:16:13,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15571 to 15531. [2023-12-25 07:16:13,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15531 states, 13548 states have (on average 1.1539710658399764) internal successors, (15634), 13674 states have internal predecessors, (15634), 1030 states have call successors, (1030), 785 states have call predecessors, (1030), 952 states have return successors, (1244), 1072 states have call predecessors, (1244), 1028 states have call successors, (1244) [2023-12-25 07:16:13,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15531 states to 15531 states and 17908 transitions. [2023-12-25 07:16:13,974 INFO L78 Accepts]: Start accepts. Automaton has 15531 states and 17908 transitions. Word has length 239 [2023-12-25 07:16:13,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:16:13,975 INFO L495 AbstractCegarLoop]: Abstraction has 15531 states and 17908 transitions. [2023-12-25 07:16:13,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-25 07:16:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 15531 states and 17908 transitions. [2023-12-25 07:16:13,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2023-12-25 07:16:13,995 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:16:13,995 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:16:13,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 (27)] Forceful destruction successful, exit code 0 [2023-12-25 07:16:14,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:14,199 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:16:14,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:16:14,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1664289807, now seen corresponding path program 1 times [2023-12-25 07:16:14,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:16:14,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797439824] [2023-12-25 07:16:14,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:16:14,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:14,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:16:14,201 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:16:14,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-25 07:16:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:16:14,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:16:14,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:16:14,344 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-25 07:16:14,344 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:16:14,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:16:14,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797439824] [2023-12-25 07:16:14,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797439824] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:16:14,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:16:14,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:16:14,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500559094] [2023-12-25 07:16:14,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:16:14,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:16:14,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:16:14,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:16:14,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:14,345 INFO L87 Difference]: Start difference. First operand 15531 states and 17908 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-25 07:16:14,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:16:14,681 INFO L93 Difference]: Finished difference Result 19803 states and 22797 transitions. [2023-12-25 07:16:14,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:16:14,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 242 [2023-12-25 07:16:14,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:16:14,689 INFO L225 Difference]: With dead ends: 19803 [2023-12-25 07:16:14,689 INFO L226 Difference]: Without dead ends: 3745 [2023-12-25 07:16:14,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:14,703 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 147 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:16:14,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 404 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:16:14,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2023-12-25 07:16:14,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3745. [2023-12-25 07:16:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3745 states, 3250 states have (on average 1.1003076923076922) internal successors, (3576), 3270 states have internal predecessors, (3576), 282 states have call successors, (282), 197 states have call predecessors, (282), 212 states have return successors, (296), 278 states have call predecessors, (296), 280 states have call successors, (296) [2023-12-25 07:16:14,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3745 states to 3745 states and 4154 transitions. [2023-12-25 07:16:14,892 INFO L78 Accepts]: Start accepts. Automaton has 3745 states and 4154 transitions. Word has length 242 [2023-12-25 07:16:14,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:16:14,893 INFO L495 AbstractCegarLoop]: Abstraction has 3745 states and 4154 transitions. [2023-12-25 07:16:14,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-25 07:16:14,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3745 states and 4154 transitions. [2023-12-25 07:16:14,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2023-12-25 07:16:14,897 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:16:14,897 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:16:14,903 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-25 07:16:15,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:15,101 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:16:15,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:16:15,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1145052192, now seen corresponding path program 1 times [2023-12-25 07:16:15,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:16:15,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722821733] [2023-12-25 07:16:15,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:16:15,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:15,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:16:15,103 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:16:15,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-25 07:16:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:16:15,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:16:15,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:16:15,269 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-25 07:16:15,269 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:16:15,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:16:15,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722821733] [2023-12-25 07:16:15,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722821733] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:16:15,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:16:15,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:16:15,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79510197] [2023-12-25 07:16:15,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:16:15,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:16:15,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:16:15,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:16:15,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:15,271 INFO L87 Difference]: Start difference. First operand 3745 states and 4154 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-25 07:16:15,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:16:15,595 INFO L93 Difference]: Finished difference Result 8409 states and 9460 transitions. [2023-12-25 07:16:15,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:16:15,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 243 [2023-12-25 07:16:15,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:16:15,604 INFO L225 Difference]: With dead ends: 8409 [2023-12-25 07:16:15,604 INFO L226 Difference]: Without dead ends: 4231 [2023-12-25 07:16:15,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:15,609 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 148 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:16:15,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 350 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:16:15,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4231 states. [2023-12-25 07:16:15,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4231 to 4191. [2023-12-25 07:16:15,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4191 states, 3636 states have (on average 1.094884488448845) internal successors, (3981), 3658 states have internal predecessors, (3981), 316 states have call successors, (316), 221 states have call predecessors, (316), 238 states have return successors, (342), 312 states have call predecessors, (342), 314 states have call successors, (342) [2023-12-25 07:16:15,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4191 states to 4191 states and 4639 transitions. [2023-12-25 07:16:15,862 INFO L78 Accepts]: Start accepts. Automaton has 4191 states and 4639 transitions. Word has length 243 [2023-12-25 07:16:15,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:16:15,862 INFO L495 AbstractCegarLoop]: Abstraction has 4191 states and 4639 transitions. [2023-12-25 07:16:15,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-25 07:16:15,863 INFO L276 IsEmpty]: Start isEmpty. Operand 4191 states and 4639 transitions. [2023-12-25 07:16:15,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-25 07:16:15,867 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:16:15,867 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:16:15,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-12-25 07:16:16,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:16,071 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:16:16,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:16:16,072 INFO L85 PathProgramCache]: Analyzing trace with hash -251681407, now seen corresponding path program 1 times [2023-12-25 07:16:16,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:16:16,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265340357] [2023-12-25 07:16:16,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:16:16,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:16,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:16:16,074 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:16:16,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-12-25 07:16:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:16:16,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:16:16,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:16:16,195 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-12-25 07:16:16,195 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:16:16,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:16:16,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1265340357] [2023-12-25 07:16:16,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1265340357] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:16:16,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:16:16,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:16:16,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269117313] [2023-12-25 07:16:16,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:16:16,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:16:16,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:16:16,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:16:16,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:16,197 INFO L87 Difference]: Start difference. First operand 4191 states and 4639 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-25 07:16:16,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:16:16,438 INFO L93 Difference]: Finished difference Result 6769 states and 7580 transitions. [2023-12-25 07:16:16,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:16:16,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 244 [2023-12-25 07:16:16,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:16:16,445 INFO L225 Difference]: With dead ends: 6769 [2023-12-25 07:16:16,445 INFO L226 Difference]: Without dead ends: 4191 [2023-12-25 07:16:16,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:16,449 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 159 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:16:16,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 424 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:16:16,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4191 states. [2023-12-25 07:16:16,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4191 to 4191. [2023-12-25 07:16:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4191 states, 3636 states have (on average 1.0855335533553356) internal successors, (3947), 3658 states have internal predecessors, (3947), 316 states have call successors, (316), 221 states have call predecessors, (316), 238 states have return successors, (342), 312 states have call predecessors, (342), 314 states have call successors, (342) [2023-12-25 07:16:16,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4191 states to 4191 states and 4605 transitions. [2023-12-25 07:16:16,668 INFO L78 Accepts]: Start accepts. Automaton has 4191 states and 4605 transitions. Word has length 244 [2023-12-25 07:16:16,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:16:16,669 INFO L495 AbstractCegarLoop]: Abstraction has 4191 states and 4605 transitions. [2023-12-25 07:16:16,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-25 07:16:16,670 INFO L276 IsEmpty]: Start isEmpty. Operand 4191 states and 4605 transitions. [2023-12-25 07:16:16,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2023-12-25 07:16:16,674 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:16:16,675 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:16:16,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-12-25 07:16:16,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:16,879 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:16:16,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:16:16,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1223250227, now seen corresponding path program 1 times [2023-12-25 07:16:16,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:16:16,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382118665] [2023-12-25 07:16:16,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:16:16,880 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:16,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:16:16,881 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:16:16,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-25 07:16:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:16:16,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:16:16,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:16:17,024 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2023-12-25 07:16:17,024 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:16:17,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:16:17,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382118665] [2023-12-25 07:16:17,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1382118665] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:16:17,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:16:17,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:16:17,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125802569] [2023-12-25 07:16:17,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:16:17,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:16:17,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:16:17,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:16:17,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:17,026 INFO L87 Difference]: Start difference. First operand 4191 states and 4605 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-25 07:16:17,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:16:17,402 INFO L93 Difference]: Finished difference Result 8789 states and 9811 transitions. [2023-12-25 07:16:17,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:16:17,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 247 [2023-12-25 07:16:17,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:16:17,410 INFO L225 Difference]: With dead ends: 8789 [2023-12-25 07:16:17,411 INFO L226 Difference]: Without dead ends: 4437 [2023-12-25 07:16:17,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:17,431 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 139 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:16:17,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 343 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:16:17,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4437 states. [2023-12-25 07:16:17,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4437 to 4435. [2023-12-25 07:16:17,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4435 states, 3846 states have (on average 1.078523140925637) internal successors, (4148), 3871 states have internal predecessors, (4148), 335 states have call successors, (335), 235 states have call predecessors, (335), 253 states have return successors, (369), 329 states have call predecessors, (369), 333 states have call successors, (369) [2023-12-25 07:16:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4435 states to 4435 states and 4852 transitions. [2023-12-25 07:16:17,732 INFO L78 Accepts]: Start accepts. Automaton has 4435 states and 4852 transitions. Word has length 247 [2023-12-25 07:16:17,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:16:17,732 INFO L495 AbstractCegarLoop]: Abstraction has 4435 states and 4852 transitions. [2023-12-25 07:16:17,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-25 07:16:17,732 INFO L276 IsEmpty]: Start isEmpty. Operand 4435 states and 4852 transitions. [2023-12-25 07:16:17,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2023-12-25 07:16:17,740 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:16:17,740 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:16:17,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-12-25 07:16:17,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:17,945 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:16:17,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:16:17,945 INFO L85 PathProgramCache]: Analyzing trace with hash -579882755, now seen corresponding path program 1 times [2023-12-25 07:16:17,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:16:17,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510606822] [2023-12-25 07:16:17,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:16:17,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:17,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:16:17,947 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:16:17,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-12-25 07:16:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:16:18,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:16:18,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:16:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-25 07:16:18,100 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:16:18,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:16:18,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510606822] [2023-12-25 07:16:18,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510606822] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:16:18,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:16:18,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:16:18,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324759520] [2023-12-25 07:16:18,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:16:18,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:16:18,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:16:18,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:16:18,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:18,101 INFO L87 Difference]: Start difference. First operand 4435 states and 4852 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-25 07:16:18,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:16:18,359 INFO L93 Difference]: Finished difference Result 8051 states and 8887 transitions. [2023-12-25 07:16:18,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:16:18,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 249 [2023-12-25 07:16:18,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:16:18,366 INFO L225 Difference]: With dead ends: 8051 [2023-12-25 07:16:18,366 INFO L226 Difference]: Without dead ends: 4435 [2023-12-25 07:16:18,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:18,371 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 142 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:16:18,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 362 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:16:18,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4435 states. [2023-12-25 07:16:18,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4435 to 4435. [2023-12-25 07:16:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4435 states, 3846 states have (on average 1.0681227249089964) internal successors, (4108), 3871 states have internal predecessors, (4108), 335 states have call successors, (335), 235 states have call predecessors, (335), 253 states have return successors, (369), 329 states have call predecessors, (369), 333 states have call successors, (369) [2023-12-25 07:16:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4435 states to 4435 states and 4812 transitions. [2023-12-25 07:16:18,630 INFO L78 Accepts]: Start accepts. Automaton has 4435 states and 4812 transitions. Word has length 249 [2023-12-25 07:16:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:16:18,630 INFO L495 AbstractCegarLoop]: Abstraction has 4435 states and 4812 transitions. [2023-12-25 07:16:18,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-25 07:16:18,631 INFO L276 IsEmpty]: Start isEmpty. Operand 4435 states and 4812 transitions. [2023-12-25 07:16:18,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2023-12-25 07:16:18,635 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:16:18,635 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:16:18,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2023-12-25 07:16:18,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:18,837 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:16:18,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:16:18,838 INFO L85 PathProgramCache]: Analyzing trace with hash -191325233, now seen corresponding path program 1 times [2023-12-25 07:16:18,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:16:18,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814076873] [2023-12-25 07:16:18,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:16:18,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:18,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:16:18,839 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:16:18,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-12-25 07:16:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:16:18,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:16:18,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:16:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-25 07:16:19,061 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:16:19,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:16:19,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814076873] [2023-12-25 07:16:19,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814076873] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:16:19,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:16:19,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:16:19,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704163960] [2023-12-25 07:16:19,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:16:19,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:16:19,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:16:19,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:16:19,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:19,064 INFO L87 Difference]: Start difference. First operand 4435 states and 4812 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-25 07:16:19,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:16:19,349 INFO L93 Difference]: Finished difference Result 5781 states and 6288 transitions. [2023-12-25 07:16:19,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:16:19,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 252 [2023-12-25 07:16:19,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:16:19,356 INFO L225 Difference]: With dead ends: 5781 [2023-12-25 07:16:19,356 INFO L226 Difference]: Without dead ends: 3989 [2023-12-25 07:16:19,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:19,361 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 129 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:16:19,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 405 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:16:19,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3989 states. [2023-12-25 07:16:19,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3989 to 3989. [2023-12-25 07:16:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3989 states, 3460 states have (on average 1.0661849710982658) internal successors, (3689), 3483 states have internal predecessors, (3689), 301 states have call successors, (301), 211 states have call predecessors, (301), 227 states have return successors, (323), 295 states have call predecessors, (323), 299 states have call successors, (323) [2023-12-25 07:16:19,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3989 states to 3989 states and 4313 transitions. [2023-12-25 07:16:19,596 INFO L78 Accepts]: Start accepts. Automaton has 3989 states and 4313 transitions. Word has length 252 [2023-12-25 07:16:19,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:16:19,597 INFO L495 AbstractCegarLoop]: Abstraction has 3989 states and 4313 transitions. [2023-12-25 07:16:19,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-25 07:16:19,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3989 states and 4313 transitions. [2023-12-25 07:16:19,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2023-12-25 07:16:19,601 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:16:19,601 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:16:19,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 (33)] Forceful destruction successful, exit code 0 [2023-12-25 07:16:19,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:19,805 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:16:19,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:16:19,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1668062359, now seen corresponding path program 2 times [2023-12-25 07:16:19,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:16:19,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663941755] [2023-12-25 07:16:19,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 07:16:19,806 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:19,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:16:19,807 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:16:19,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-12-25 07:16:19,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 07:16:19,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 07:16:19,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:16:19,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:16:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 124 proven. 159 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 07:16:20,224 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:16:20,349 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2023-12-25 07:16:20,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:16:20,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663941755] [2023-12-25 07:16:20,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663941755] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 07:16:20,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 07:16:20,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2023-12-25 07:16:20,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769783764] [2023-12-25 07:16:20,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:16:20,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 07:16:20,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:16:20,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 07:16:20,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:16:20,352 INFO L87 Difference]: Start difference. First operand 3989 states and 4313 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-12-25 07:16:20,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:16:20,936 INFO L93 Difference]: Finished difference Result 3993 states and 4316 transitions. [2023-12-25 07:16:20,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 07:16:20,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 254 [2023-12-25 07:16:20,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:16:20,967 INFO L225 Difference]: With dead ends: 3993 [2023-12-25 07:16:20,967 INFO L226 Difference]: Without dead ends: 3990 [2023-12-25 07:16:20,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:16:20,968 INFO L413 NwaCegarLoop]: 475 mSDtfsCounter, 479 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:16:20,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1633 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 07:16:20,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3990 states. [2023-12-25 07:16:21,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3990 to 3988. [2023-12-25 07:16:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3988 states, 3460 states have (on average 1.0656069364161849) internal successors, (3687), 3482 states have internal predecessors, (3687), 300 states have call successors, (300), 211 states have call predecessors, (300), 227 states have return successors, (323), 295 states have call predecessors, (323), 299 states have call successors, (323) [2023-12-25 07:16:21,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3988 states to 3988 states and 4310 transitions. [2023-12-25 07:16:21,200 INFO L78 Accepts]: Start accepts. Automaton has 3988 states and 4310 transitions. Word has length 254 [2023-12-25 07:16:21,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:16:21,200 INFO L495 AbstractCegarLoop]: Abstraction has 3988 states and 4310 transitions. [2023-12-25 07:16:21,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-12-25 07:16:21,200 INFO L276 IsEmpty]: Start isEmpty. Operand 3988 states and 4310 transitions. [2023-12-25 07:16:21,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-25 07:16:21,203 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:16:21,203 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:16:21,207 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 (34)] Forceful destruction successful, exit code 0 [2023-12-25 07:16:21,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:21,407 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:16:21,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:16:21,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1312769233, now seen corresponding path program 1 times [2023-12-25 07:16:21,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:16:21,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2068831455] [2023-12-25 07:16:21,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:16:21,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:21,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:16:21,409 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:16:21,434 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 (35)] Waiting until timeout for monitored process [2023-12-25 07:16:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:16:21,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:16:21,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:16:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2023-12-25 07:16:21,521 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:16:21,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:16:21,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2068831455] [2023-12-25 07:16:21,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2068831455] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:16:21,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:16:21,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:16:21,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332639458] [2023-12-25 07:16:21,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:16:21,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:16:21,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:16:21,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:16:21,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:21,522 INFO L87 Difference]: Start difference. First operand 3988 states and 4310 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-25 07:16:21,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:16:21,838 INFO L93 Difference]: Finished difference Result 5343 states and 5777 transitions. [2023-12-25 07:16:21,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:16:21,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 258 [2023-12-25 07:16:21,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:16:21,844 INFO L225 Difference]: With dead ends: 5343 [2023-12-25 07:16:21,844 INFO L226 Difference]: Without dead ends: 3998 [2023-12-25 07:16:21,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:16:21,846 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 3 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:16:21,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 348 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:16:21,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3998 states. [2023-12-25 07:16:22,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3998 to 3990. [2023-12-25 07:16:22,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3990 states, 3462 states have (on average 1.0655690352397458) internal successors, (3689), 3484 states have internal predecessors, (3689), 300 states have call successors, (300), 211 states have call predecessors, (300), 227 states have return successors, (323), 295 states have call predecessors, (323), 299 states have call successors, (323) [2023-12-25 07:16:22,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3990 states to 3990 states and 4312 transitions. [2023-12-25 07:16:22,078 INFO L78 Accepts]: Start accepts. Automaton has 3990 states and 4312 transitions. Word has length 258 [2023-12-25 07:16:22,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:16:22,078 INFO L495 AbstractCegarLoop]: Abstraction has 3990 states and 4312 transitions. [2023-12-25 07:16:22,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-25 07:16:22,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3990 states and 4312 transitions. [2023-12-25 07:16:22,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2023-12-25 07:16:22,082 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:16:22,082 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:16:22,086 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 (35)] Forceful destruction successful, exit code 0 [2023-12-25 07:16:22,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:22,286 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:16:22,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:16:22,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1024700259, now seen corresponding path program 1 times [2023-12-25 07:16:22,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:16:22,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722108617] [2023-12-25 07:16:22,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:16:22,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:22,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:16:22,288 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:16:22,290 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 (36)] Waiting until timeout for monitored process [2023-12-25 07:16:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 07:16:22,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 07:16:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 07:16:22,642 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 07:16:22,642 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 07:16:22,643 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 07:16:22,665 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 (36)] Forceful destruction successful, exit code 0 [2023-12-25 07:16:22,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:16:22,853 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:16:22,856 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 07:16:23,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 07:16:23 BoogieIcfgContainer [2023-12-25 07:16:23,007 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 07:16:23,008 INFO L158 Benchmark]: Toolchain (without parser) took 33750.40ms. Allocated memory was 211.8MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 160.2MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2023-12-25 07:16:23,008 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 07:16:23,009 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.18ms. Allocated memory is still 211.8MB. Free memory was 159.9MB in the beginning and 143.7MB in the end (delta: 16.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-25 07:16:23,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.63ms. Allocated memory is still 211.8MB. Free memory was 143.7MB in the beginning and 141.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 07:16:23,009 INFO L158 Benchmark]: Boogie Preprocessor took 52.21ms. Allocated memory is still 211.8MB. Free memory was 141.4MB in the beginning and 138.5MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 07:16:23,009 INFO L158 Benchmark]: RCFGBuilder took 578.14ms. Allocated memory is still 211.8MB. Free memory was 138.2MB in the beginning and 177.1MB in the end (delta: -38.9MB). Peak memory consumption was 35.6MB. Max. memory is 8.0GB. [2023-12-25 07:16:23,009 INFO L158 Benchmark]: TraceAbstraction took 32746.50ms. Allocated memory was 211.8MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 176.5MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2023-12-25 07:16:23,010 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 320.18ms. Allocated memory is still 211.8MB. Free memory was 159.9MB in the beginning and 143.7MB in the end (delta: 16.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.63ms. Allocated memory is still 211.8MB. Free memory was 143.7MB in the beginning and 141.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.21ms. Allocated memory is still 211.8MB. Free memory was 141.4MB in the beginning and 138.5MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 578.14ms. Allocated memory is still 211.8MB. Free memory was 138.2MB in the beginning and 177.1MB in the end (delta: -38.9MB). Peak memory consumption was 35.6MB. Max. memory is 8.0GB. * TraceAbstraction took 32746.50ms. Allocated memory was 211.8MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 176.5MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.0GB. 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: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int t2_pc = 0; [L27] int t3_pc = 0; [L28] int m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int t3_st ; [L32] int m_i ; [L33] int t1_i ; [L34] int t2_i ; [L35] int t3_i ; [L36] int M_E = 2; [L37] int T1_E = 2; [L38] int T2_E = 2; [L39] int T3_E = 2; [L40] int E_M = 2; [L41] int E_1 = 2; [L42] int E_2 = 2; [L43] int E_3 = 2; [L49] int token ; [L51] int local ; [L735] int __retres1 ; [L739] CALL init_model() [L648] m_i = 1 [L649] t1_i = 1 [L650] t2_i = 1 [L651] t3_i = 1 [L739] RET init_model() [L740] CALL start_simulation() [L676] int kernel_st ; [L677] int tmp ; [L678] int tmp___0 ; [L682] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L683] FCALL update_channels() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L684] CALL init_threads() [L304] COND TRUE m_i == 1 [L305] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L309] COND TRUE t1_i == 1 [L310] t1_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L314] COND TRUE t2_i == 1 [L315] t2_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L319] COND TRUE t3_i == 1 [L320] t3_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L684] RET init_threads() [L685] CALL fire_delta_events() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L441] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L446] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L451] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L456] COND FALSE !(T3_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L461] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L466] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L471] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L476] COND FALSE !(E_3 == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L685] RET fire_delta_events() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L686] CALL activate_threads() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L541] CALL, EXPR is_master_triggered() [L217] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L220] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L230] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L232] return (__retres1); [L541] RET, EXPR is_master_triggered() [L541] tmp = is_master_triggered() [L543] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=0, token=0] [L549] CALL, EXPR is_transmit1_triggered() [L236] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L239] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L249] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L251] return (__retres1); [L549] RET, EXPR is_transmit1_triggered() [L549] tmp___0 = is_transmit1_triggered() [L551] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, token=0] [L557] CALL, EXPR is_transmit2_triggered() [L255] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L258] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L268] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L270] return (__retres1); [L557] RET, EXPR is_transmit2_triggered() [L557] tmp___1 = is_transmit2_triggered() [L559] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L565] CALL, EXPR is_transmit3_triggered() [L274] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L277] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L287] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L289] return (__retres1); [L565] RET, EXPR is_transmit3_triggered() [L565] tmp___2 = is_transmit3_triggered() [L567] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=0, token=0] [L686] RET activate_threads() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L687] CALL reset_delta_events() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L489] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L494] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L499] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L504] COND FALSE !(T3_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L509] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L514] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L519] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L524] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L687] RET reset_delta_events() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L690] COND TRUE 1 [L693] kernel_st = 1 [L694] CALL eval() [L360] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L364] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L367] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L329] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L332] COND TRUE m_st == 0 [L333] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L355] return (__retres1); [L367] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L367] tmp = exists_runnable_thread() [L369] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=1, token=0] [L374] COND TRUE m_st == 0 [L375] int tmp_ndt_1; [L376] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L377] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0, token=0] [L374-L385] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=1, token=0] [L388] COND TRUE t1_st == 0 [L389] int tmp_ndt_2; [L390] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L391] COND TRUE, EXPR \read(tmp_ndt_2) [L393] EXPR t1_st = 1 [L394] CALL, EXPR transmit1() [L112] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L123] COND TRUE 1 [L125] t1_pc = 1 [L126] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L394] RET, EXPR transmit1() [L388-L399] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=1, token=0] [L402] COND TRUE t2_st == 0 [L403] int tmp_ndt_3; [L404] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L405] COND TRUE, EXPR \read(tmp_ndt_3) [L407] EXPR t2_st = 1 [L408] CALL, EXPR transmit2() [L148] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1, t3_i=1, t3_pc=0, t3_st=0, token=0] [L159] COND TRUE 1 [L161] t2_pc = 1 [L162] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L408] RET, EXPR transmit2() [L402-L413] { int tmp_ndt_3; tmp_ndt_3 = __VERIFIER_nondet_int(); if (tmp_ndt_3) { { t2_st = 1; transmit2(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, token=0] [L416] COND TRUE t3_st == 0 [L417] int tmp_ndt_4; [L418] EXPR tmp_ndt_4 = __VERIFIER_nondet_int() [L419] COND TRUE, EXPR \read(tmp_ndt_4) [L421] EXPR t3_st = 1 [L422] CALL, EXPR transmit3() [L184] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L195] COND TRUE 1 [L197] t3_pc = 1 [L198] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L422] RET, EXPR transmit3() [L416-L427] { int tmp_ndt_4; tmp_ndt_4 = __VERIFIER_nondet_int(); if (tmp_ndt_4) { { t3_st = 1; transmit3(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=0] [L364] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=0] [L367] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L329] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L332] COND TRUE m_st == 0 [L333] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L355] return (__retres1); [L367] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=0] [L367] tmp = exists_runnable_thread() [L369] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=0] [L374] COND TRUE m_st == 0 [L375] int tmp_ndt_1; [L376] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L377] COND TRUE, EXPR \read(tmp_ndt_1) [L379] EXPR m_st = 1 [L380] CALL, EXPR master() [L54] int tmp_var = __VERIFIER_nondet_int(); [L56] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L67] COND TRUE 1 [L70] token = __VERIFIER_nondet_int() [L71] local = token [L72] E_1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L73] CALL immediate_notify() VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L581] CALL activate_threads() VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L541] CALL, EXPR is_master_triggered() [L217] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L220] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L230] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L232] return (__retres1); [L541] RET, EXPR is_master_triggered() [L541] tmp = is_master_triggered() [L543] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=0] [L549] CALL, EXPR is_transmit1_triggered() [L236] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L239] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L240] COND TRUE E_1 == 1 [L241] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L251] return (__retres1); [L549] RET, EXPR is_transmit1_triggered() [L549] tmp___0 = is_transmit1_triggered() [L551] COND TRUE \read(tmp___0) [L552] t1_st = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, token=0] [L557] CALL, EXPR is_transmit2_triggered() [L255] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L258] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L259] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L268] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L270] return (__retres1); [L557] RET, EXPR is_transmit2_triggered() [L557] tmp___1 = is_transmit2_triggered() [L559] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L565] CALL, EXPR is_transmit3_triggered() [L274] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L277] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L278] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L287] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L289] return (__retres1); [L565] RET, EXPR is_transmit3_triggered() [L565] tmp___2 = is_transmit3_triggered() [L567] COND FALSE !(\read(tmp___2)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, tmp___2=0, token=0] [L581] RET activate_threads() VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L73] RET immediate_notify() VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L74] E_1 = 2 [L75] m_pc = 1 [L76] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L380] RET, EXPR master() [L374-L385] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=0] [L388] COND TRUE t1_st == 0 [L389] int tmp_ndt_2; [L390] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L391] COND TRUE, EXPR \read(tmp_ndt_2) [L393] EXPR t1_st = 1 [L394] CALL, EXPR transmit1() [L112] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L115] COND TRUE t1_pc == 1 [L131] token += 1 [L132] E_2 = 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L133] CALL immediate_notify() VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L581] CALL activate_threads() VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L541] CALL, EXPR is_master_triggered() [L217] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L220] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L221] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L230] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L232] return (__retres1); [L541] RET, EXPR is_master_triggered() [L541] tmp = is_master_triggered() [L543] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=1] [L549] CALL, EXPR is_transmit1_triggered() [L236] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L239] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L240] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L249] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L251] return (__retres1); [L549] RET, EXPR is_transmit1_triggered() [L549] tmp___0 = is_transmit1_triggered() [L551] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=1] [L557] CALL, EXPR is_transmit2_triggered() [L255] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L258] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L259] COND TRUE E_2 == 1 [L260] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L270] return (__retres1); [L557] RET, EXPR is_transmit2_triggered() [L557] tmp___1 = is_transmit2_triggered() [L559] COND TRUE \read(tmp___1) [L560] t2_st = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, token=1] [L565] CALL, EXPR is_transmit3_triggered() [L274] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, token=1] [L277] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, token=1] [L278] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, token=1] [L287] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, token=1] [L289] return (__retres1); [L565] RET, EXPR is_transmit3_triggered() [L565] tmp___2 = is_transmit3_triggered() [L567] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, tmp___2=0, token=1] [L581] RET activate_threads() VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, token=1] [L133] RET immediate_notify() VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, token=1] [L134] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, token=1] [L123] COND TRUE 1 [L125] t1_pc = 1 [L126] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, token=1] [L394] RET, EXPR transmit1() [L388-L399] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=1] [L402] COND TRUE t2_st == 0 [L403] int tmp_ndt_3; [L404] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L405] COND TRUE, EXPR \read(tmp_ndt_3) [L407] EXPR t2_st = 1 [L408] CALL, EXPR transmit2() [L148] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=1] [L151] COND TRUE t2_pc == 1 [L167] token += 1 [L168] E_3 = 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L169] CALL immediate_notify() VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L581] CALL activate_threads() VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L541] CALL, EXPR is_master_triggered() [L217] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L220] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L221] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L230] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L232] return (__retres1); [L541] RET, EXPR is_master_triggered() [L541] tmp = is_master_triggered() [L543] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=2] [L549] CALL, EXPR is_transmit1_triggered() [L236] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L239] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L240] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L249] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L251] return (__retres1); [L549] RET, EXPR is_transmit1_triggered() [L549] tmp___0 = is_transmit1_triggered() [L551] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=2] [L557] CALL, EXPR is_transmit2_triggered() [L255] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L258] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L259] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L268] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L270] return (__retres1); [L557] RET, EXPR is_transmit2_triggered() [L557] tmp___1 = is_transmit2_triggered() [L559] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=0, token=2] [L565] CALL, EXPR is_transmit3_triggered() [L274] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L277] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L278] COND TRUE E_3 == 1 [L279] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=1, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L289] return (__retres1); [L565] RET, EXPR is_transmit3_triggered() [L565] tmp___2 = is_transmit3_triggered() [L567] COND TRUE \read(tmp___2) [L568] t3_st = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=1, token=2] [L581] RET activate_threads() VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=0, token=2] [L169] RET immediate_notify() VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=0, token=2] [L170] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=0, token=2] [L159] COND TRUE 1 [L161] t2_pc = 1 [L162] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L408] RET, EXPR transmit2() [L402-L413] { int tmp_ndt_3; tmp_ndt_3 = __VERIFIER_nondet_int(); if (tmp_ndt_3) { { t2_st = 1; transmit2(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=0, tmp=1, token=2] [L416] COND TRUE t3_st == 0 [L417] int tmp_ndt_4; [L418] EXPR tmp_ndt_4 = __VERIFIER_nondet_int() [L419] COND TRUE, EXPR \read(tmp_ndt_4) [L421] EXPR t3_st = 1 [L422] CALL, EXPR transmit3() [L184] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L187] COND TRUE t3_pc == 1 [L203] token += 1 [L204] E_M = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L205] CALL immediate_notify() VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L581] CALL activate_threads() VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L541] CALL, EXPR is_master_triggered() [L217] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L220] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L221] COND TRUE E_M == 1 [L222] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=1, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L232] return (__retres1); [L541] RET, EXPR is_master_triggered() [L541] tmp = is_master_triggered() [L543] COND TRUE \read(tmp) [L544] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, token=3] [L549] CALL, EXPR is_transmit1_triggered() [L236] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L239] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L240] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L249] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L251] return (__retres1); [L549] RET, EXPR is_transmit1_triggered() [L549] tmp___0 = is_transmit1_triggered() [L551] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, token=3] [L557] CALL, EXPR is_transmit2_triggered() [L255] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L258] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L259] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L268] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L270] return (__retres1); [L557] RET, EXPR is_transmit2_triggered() [L557] tmp___1 = is_transmit2_triggered() [L559] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, tmp___1=0, token=3] [L565] CALL, EXPR is_transmit3_triggered() [L274] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L277] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L278] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L287] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L289] return (__retres1); [L565] RET, EXPR is_transmit3_triggered() [L565] tmp___2 = is_transmit3_triggered() [L567] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, token=3] [L581] RET activate_threads() VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L205] RET immediate_notify() VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L206] E_M = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L195] COND TRUE 1 [L197] t3_pc = 1 [L198] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L422] RET, EXPR transmit3() [L416-L427] { int tmp_ndt_4; tmp_ndt_4 = __VERIFIER_nondet_int(); if (tmp_ndt_4) { { t3_st = 1; transmit3(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=3] [L364] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=3] [L367] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L329] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L332] COND TRUE m_st == 0 [L333] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, __retres1=1, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L355] return (__retres1); [L367] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=3] [L367] tmp = exists_runnable_thread() [L369] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=3] [L374] COND TRUE m_st == 0 [L375] int tmp_ndt_1; [L376] tmp_ndt_1 = __VERIFIER_nondet_int() [L377] COND TRUE \read(tmp_ndt_1) [L379] m_st = 1 [L380] CALL master() [L54] int tmp_var = __VERIFIER_nondet_int(); [L56] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L59] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L81] COND FALSE !(token != local + 3) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L86] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L87] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L92] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L93] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L94] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L95] CALL error() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L20] reach_error() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 149 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.5s, OverallIterations: 35, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6038 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5927 mSDsluCounter, 14537 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7595 mSDsCounter, 433 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3952 IncrementalHoareTripleChecker+Invalid, 4385 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 433 mSolverCounterUnsat, 6942 mSDtfsCounter, 3952 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5075 GetRequests, 5002 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15531occurred in iteration=26, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 271 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 5099 NumberOfCodeBlocks, 5099 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 5059 ConstructedInterpolants, 0 QuantifiedInterpolants, 8407 SizeOfPredicates, 4 NumberOfNonLiveVariables, 9577 ConjunctsInSsa, 117 ConjunctsInUnsatCore, 35 InterpolantComputations, 34 PerfectInterpolantSequences, 3504/3663 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-25 07:16:23,052 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...