/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 07:23:02,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 07:23:02,665 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:23:02,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 07:23:02,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 07:23:02,695 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 07:23:02,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 07:23:02,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 07:23:02,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 07:23:02,701 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 07:23:02,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 07:23:02,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 07:23:02,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 07:23:02,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 07:23:02,703 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 07:23:02,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 07:23:02,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 07:23:02,704 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 07:23:02,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 07:23:02,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 07:23:02,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 07:23:02,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 07:23:02,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 07:23:02,705 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 07:23:02,705 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 07:23:02,705 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 07:23:02,705 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 07:23:02,706 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 07:23:02,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 07:23:02,706 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 07:23:02,707 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 07:23:02,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 07:23:02,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 07:23:02,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 07:23:02,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:23:02,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 07:23:02,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 07:23:02,708 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 07:23:02,708 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 07:23:02,708 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 07:23:02,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 07:23:02,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 07:23:02,708 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 07:23:02,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 07:23:02,709 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 07:23:02,709 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 07:23:02,709 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:23:02,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 07:23:02,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 07:23:02,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 07:23:02,946 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 07:23:02,946 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 07:23:02,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2023-12-25 07:23:04,170 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 07:23:04,366 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 07:23:04,367 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2023-12-25 07:23:04,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae66aec40/5a94fc0a3ecb40618cce574dbed97a8e/FLAG3bb0f8dce [2023-12-25 07:23:04,399 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae66aec40/5a94fc0a3ecb40618cce574dbed97a8e [2023-12-25 07:23:04,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 07:23:04,403 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 07:23:04,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 07:23:04,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 07:23:04,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 07:23:04,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:23:04" (1/1) ... [2023-12-25 07:23:04,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d20a5d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:23:04, skipping insertion in model container [2023-12-25 07:23:04,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:23:04" (1/1) ... [2023-12-25 07:23:04,454 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 07:23:04,682 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c[11921,11934] [2023-12-25 07:23:04,685 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:23:04,696 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 07:23:04,743 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c[11921,11934] [2023-12-25 07:23:04,744 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:23:04,769 INFO L206 MainTranslator]: Completed translation [2023-12-25 07:23:04,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:23:04 WrapperNode [2023-12-25 07:23:04,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 07:23:04,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 07:23:04,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 07:23:04,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 07:23:04,775 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:23:04" (1/1) ... [2023-12-25 07:23:04,801 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:23:04" (1/1) ... [2023-12-25 07:23:04,833 INFO L138 Inliner]: procedures = 28, calls = 51, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 377 [2023-12-25 07:23:04,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 07:23:04,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 07:23:04,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 07:23:04,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 07:23:04,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:23:04" (1/1) ... [2023-12-25 07:23:04,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:23:04" (1/1) ... [2023-12-25 07:23:04,859 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:23:04" (1/1) ... [2023-12-25 07:23:04,879 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:23:04,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:23:04" (1/1) ... [2023-12-25 07:23:04,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:23:04" (1/1) ... [2023-12-25 07:23:04,886 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:23:04" (1/1) ... [2023-12-25 07:23:04,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:23:04" (1/1) ... [2023-12-25 07:23:04,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:23:04" (1/1) ... [2023-12-25 07:23:04,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:23:04" (1/1) ... [2023-12-25 07:23:04,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 07:23:04,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 07:23:04,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 07:23:04,897 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 07:23:04,897 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:23:04" (1/1) ... [2023-12-25 07:23:04,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:23:04,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 07:23:04,965 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:23:04,978 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:23:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 07:23:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 07:23:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2023-12-25 07:23:04,999 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2023-12-25 07:23:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2023-12-25 07:23:04,999 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2023-12-25 07:23:05,000 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2023-12-25 07:23:05,000 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2023-12-25 07:23:05,000 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2023-12-25 07:23:05,000 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2023-12-25 07:23:05,000 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2023-12-25 07:23:05,000 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2023-12-25 07:23:05,000 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 07:23:05,000 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 07:23:05,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 07:23:05,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 07:23:05,079 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 07:23:05,080 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 07:23:05,524 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 07:23:05,548 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 07:23:05,548 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 07:23:05,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:23:05 BoogieIcfgContainer [2023-12-25 07:23:05,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 07:23:05,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 07:23:05,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 07:23:05,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 07:23:05,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 07:23:04" (1/3) ... [2023-12-25 07:23:05,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc05622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:23:05, skipping insertion in model container [2023-12-25 07:23:05,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:23:04" (2/3) ... [2023-12-25 07:23:05,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc05622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:23:05, skipping insertion in model container [2023-12-25 07:23:05,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:23:05" (3/3) ... [2023-12-25 07:23:05,555 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2023-12-25 07:23:05,567 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 07:23:05,567 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 07:23:05,600 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 07:23:05,605 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;@417c6c7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 07:23:05,605 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 07:23:05,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 173 states, 128 states have (on average 1.6015625) internal successors, (205), 133 states have internal predecessors, (205), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2023-12-25 07:23:05,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-25 07:23:05,615 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:05,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:23:05,616 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:05,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:05,623 INFO L85 PathProgramCache]: Analyzing trace with hash -286189658, now seen corresponding path program 1 times [2023-12-25 07:23:05,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:05,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887725482] [2023-12-25 07:23:05,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:05,632 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:23:05,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:05,637 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:23:05,638 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:23:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:05,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:23:05,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:05,753 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:23:05,753 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:05,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:05,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887725482] [2023-12-25 07:23:05,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887725482] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:05,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:05,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:23:05,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438750981] [2023-12-25 07:23:05,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:05,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:23:05,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:05,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:23:05,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:23:05,788 INFO L87 Difference]: Start difference. First operand has 173 states, 128 states have (on average 1.6015625) internal successors, (205), 133 states have internal predecessors, (205), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:23:05,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:05,897 INFO L93 Difference]: Finished difference Result 350 states and 606 transitions. [2023-12-25 07:23:05,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:23:05,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-25 07:23:05,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:05,914 INFO L225 Difference]: With dead ends: 350 [2023-12-25 07:23:05,915 INFO L226 Difference]: Without dead ends: 179 [2023-12-25 07:23:05,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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:23:05,928 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 18 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:05,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 781 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:05,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-12-25 07:23:05,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2023-12-25 07:23:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 132 states have (on average 1.5606060606060606) internal successors, (206), 136 states have internal predecessors, (206), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2023-12-25 07:23:06,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 280 transitions. [2023-12-25 07:23:06,002 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 280 transitions. Word has length 14 [2023-12-25 07:23:06,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:06,003 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 280 transitions. [2023-12-25 07:23:06,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:23:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 280 transitions. [2023-12-25 07:23:06,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-25 07:23:06,005 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:06,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:23:06,010 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:23:06,208 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:23:06,209 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:06,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:06,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1060285134, now seen corresponding path program 1 times [2023-12-25 07:23:06,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:06,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158303697] [2023-12-25 07:23:06,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:06,210 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:23:06,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:06,211 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:23:06,213 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:23:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:06,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:23:06,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:06,272 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:23:06,272 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:06,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:06,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158303697] [2023-12-25 07:23:06,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1158303697] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:06,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:06,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:23:06,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176130973] [2023-12-25 07:23:06,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:06,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:23:06,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:06,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:23:06,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:23:06,275 INFO L87 Difference]: Start difference. First operand 177 states and 280 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:23:06,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:06,323 INFO L93 Difference]: Finished difference Result 368 states and 584 transitions. [2023-12-25 07:23:06,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:23:06,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-25 07:23:06,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:06,327 INFO L225 Difference]: With dead ends: 368 [2023-12-25 07:23:06,327 INFO L226 Difference]: Without dead ends: 193 [2023-12-25 07:23:06,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:23:06,329 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 25 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:06,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 801 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:06,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-12-25 07:23:06,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2023-12-25 07:23:06,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 147 states have internal predecessors, (220), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-25 07:23:06,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 296 transitions. [2023-12-25 07:23:06,352 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 296 transitions. Word has length 15 [2023-12-25 07:23:06,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:06,352 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 296 transitions. [2023-12-25 07:23:06,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:23:06,352 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 296 transitions. [2023-12-25 07:23:06,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 07:23:06,353 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:06,353 INFO L195 NwaCegarLoop]: trace histogram [2, 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:23:06,367 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:23:06,558 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:23:06,558 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:06,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:06,559 INFO L85 PathProgramCache]: Analyzing trace with hash 571116970, now seen corresponding path program 1 times [2023-12-25 07:23:06,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:06,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195197550] [2023-12-25 07:23:06,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:06,560 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:23:06,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:06,561 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:23:06,592 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:23:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:06,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:23:06,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:06,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:23:06,620 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:06,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:06,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195197550] [2023-12-25 07:23:06,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195197550] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:06,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:06,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:23:06,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971279740] [2023-12-25 07:23:06,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:06,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:23:06,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:06,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:23:06,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:23:06,622 INFO L87 Difference]: Start difference. First operand 190 states and 296 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 07:23:06,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:06,641 INFO L93 Difference]: Finished difference Result 400 states and 630 transitions. [2023-12-25 07:23:06,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:23:06,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2023-12-25 07:23:06,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:06,643 INFO L225 Difference]: With dead ends: 400 [2023-12-25 07:23:06,643 INFO L226 Difference]: Without dead ends: 219 [2023-12-25 07:23:06,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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:23:06,645 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 22 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:06,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 538 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:06,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-12-25 07:23:06,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 192. [2023-12-25 07:23:06,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 149 states have internal predecessors, (222), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-25 07:23:06,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 298 transitions. [2023-12-25 07:23:06,655 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 298 transitions. Word has length 23 [2023-12-25 07:23:06,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:06,655 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 298 transitions. [2023-12-25 07:23:06,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 07:23:06,655 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 298 transitions. [2023-12-25 07:23:06,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-25 07:23:06,656 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:06,656 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:23:06,661 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:23:06,859 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:23:06,860 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:06,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:06,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1029116135, now seen corresponding path program 1 times [2023-12-25 07:23:06,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:06,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546538245] [2023-12-25 07:23:06,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:06,861 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:23:06,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:06,882 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:23:06,911 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:23:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:06,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:23:06,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:06,951 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:23:06,952 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:06,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:06,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546538245] [2023-12-25 07:23:06,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546538245] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:06,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:06,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:23:06,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498018809] [2023-12-25 07:23:06,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:06,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:23:06,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:06,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:23:06,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:23:06,954 INFO L87 Difference]: Start difference. First operand 192 states and 298 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 07:23:06,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:06,982 INFO L93 Difference]: Finished difference Result 376 states and 587 transitions. [2023-12-25 07:23:06,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:23:06,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2023-12-25 07:23:06,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:06,984 INFO L225 Difference]: With dead ends: 376 [2023-12-25 07:23:06,984 INFO L226 Difference]: Without dead ends: 199 [2023-12-25 07:23:06,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:23:06,986 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 1 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:06,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1072 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-12-25 07:23:06,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2023-12-25 07:23:06,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 148 states have (on average 1.5202702702702702) internal successors, (225), 152 states have internal predecessors, (225), 38 states have call successors, (38), 8 states have call predecessors, (38), 9 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2023-12-25 07:23:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 302 transitions. [2023-12-25 07:23:07,008 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 302 transitions. Word has length 31 [2023-12-25 07:23:07,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:07,009 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 302 transitions. [2023-12-25 07:23:07,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 07:23:07,009 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 302 transitions. [2023-12-25 07:23:07,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 07:23:07,010 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:07,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:23:07,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 07:23:07,212 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:23:07,213 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:07,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:07,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1302074509, now seen corresponding path program 1 times [2023-12-25 07:23:07,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:07,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629228545] [2023-12-25 07:23:07,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:07,214 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:23:07,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:07,216 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:23:07,219 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:23:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:07,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:23:07,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:07,304 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:23:07,305 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:07,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:07,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629228545] [2023-12-25 07:23:07,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629228545] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:07,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:07,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 07:23:07,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189629247] [2023-12-25 07:23:07,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:07,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 07:23:07,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:07,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 07:23:07,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:23:07,307 INFO L87 Difference]: Start difference. First operand 196 states and 302 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 07:23:07,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:07,368 INFO L93 Difference]: Finished difference Result 338 states and 527 transitions. [2023-12-25 07:23:07,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 07:23:07,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2023-12-25 07:23:07,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:07,370 INFO L225 Difference]: With dead ends: 338 [2023-12-25 07:23:07,370 INFO L226 Difference]: Without dead ends: 192 [2023-12-25 07:23:07,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-25 07:23:07,371 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 115 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:07,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1168 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:07,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-12-25 07:23:07,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2023-12-25 07:23:07,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 145 states have (on average 1.4965517241379311) internal successors, (217), 149 states have internal predecessors, (217), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-25 07:23:07,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 293 transitions. [2023-12-25 07:23:07,381 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 293 transitions. Word has length 34 [2023-12-25 07:23:07,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:07,381 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 293 transitions. [2023-12-25 07:23:07,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 07:23:07,381 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 293 transitions. [2023-12-25 07:23:07,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 07:23:07,382 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:07,382 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:23:07,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 07:23:07,584 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:23:07,585 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:07,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:07,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1516160814, now seen corresponding path program 1 times [2023-12-25 07:23:07,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:07,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482375854] [2023-12-25 07:23:07,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:07,586 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:23:07,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:07,587 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:23:07,613 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:23:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:07,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:23:07,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:23:07,666 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:23:07,721 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:23:07,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:07,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482375854] [2023-12-25 07:23:07,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [482375854] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:23:07,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:23:07,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-25 07:23:07,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422144444] [2023-12-25 07:23:07,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:23:07,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 07:23:07,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:07,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 07:23:07,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:23:07,723 INFO L87 Difference]: Start difference. First operand 192 states and 293 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 07:23:07,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:07,789 INFO L93 Difference]: Finished difference Result 433 states and 674 transitions. [2023-12-25 07:23:07,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:23:07,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2023-12-25 07:23:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:07,791 INFO L225 Difference]: With dead ends: 433 [2023-12-25 07:23:07,791 INFO L226 Difference]: Without dead ends: 251 [2023-12-25 07:23:07,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:23:07,794 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 62 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1362 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:23:07,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1362 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:07,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-12-25 07:23:07,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 245. [2023-12-25 07:23:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 188 states have (on average 1.4680851063829787) internal successors, (276), 192 states have internal predecessors, (276), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-25 07:23:07,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 372 transitions. [2023-12-25 07:23:07,831 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 372 transitions. Word has length 34 [2023-12-25 07:23:07,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:07,831 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 372 transitions. [2023-12-25 07:23:07,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 07:23:07,831 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 372 transitions. [2023-12-25 07:23:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-25 07:23:07,835 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:07,835 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:23:07,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 07:23:08,041 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:23:08,042 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:08,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:08,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1191398994, now seen corresponding path program 2 times [2023-12-25 07:23:08,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:08,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318317034] [2023-12-25 07:23:08,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 07:23:08,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:23:08,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:08,046 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:23:08,047 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:23:08,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 07:23:08,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 07:23:08,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:23:08,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-25 07:23:08,119 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:08,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:08,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318317034] [2023-12-25 07:23:08,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318317034] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:08,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:08,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:23:08,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250055227] [2023-12-25 07:23:08,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:08,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:23:08,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:08,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:23:08,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:23:08,144 INFO L87 Difference]: Start difference. First operand 245 states and 372 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 07:23:08,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:08,186 INFO L93 Difference]: Finished difference Result 471 states and 735 transitions. [2023-12-25 07:23:08,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:23:08,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2023-12-25 07:23:08,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:08,187 INFO L225 Difference]: With dead ends: 471 [2023-12-25 07:23:08,187 INFO L226 Difference]: Without dead ends: 254 [2023-12-25 07:23:08,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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:23:08,189 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 19 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:08,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 780 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:08,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-12-25 07:23:08,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2023-12-25 07:23:08,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 194 states have (on average 1.4639175257731958) internal successors, (284), 198 states have internal predecessors, (284), 48 states have call successors, (48), 9 states have call predecessors, (48), 9 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-25 07:23:08,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 380 transitions. [2023-12-25 07:23:08,200 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 380 transitions. Word has length 56 [2023-12-25 07:23:08,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:08,201 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 380 transitions. [2023-12-25 07:23:08,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 07:23:08,201 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 380 transitions. [2023-12-25 07:23:08,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-25 07:23:08,201 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:08,202 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:23:08,225 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:23:08,404 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:23:08,404 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:08,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:08,405 INFO L85 PathProgramCache]: Analyzing trace with hash -7392099, now seen corresponding path program 1 times [2023-12-25 07:23:08,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:08,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554160863] [2023-12-25 07:23:08,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:08,406 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:23:08,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:08,409 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:23:08,416 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:23:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:08,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:23:08,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:08,491 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-25 07:23:08,491 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:08,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:08,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554160863] [2023-12-25 07:23:08,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554160863] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:08,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:08,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:23:08,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526092725] [2023-12-25 07:23:08,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:08,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:23:08,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:08,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:23:08,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:23:08,493 INFO L87 Difference]: Start difference. First operand 252 states and 380 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 07:23:08,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:08,532 INFO L93 Difference]: Finished difference Result 515 states and 787 transitions. [2023-12-25 07:23:08,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:23:08,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2023-12-25 07:23:08,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:08,535 INFO L225 Difference]: With dead ends: 515 [2023-12-25 07:23:08,535 INFO L226 Difference]: Without dead ends: 291 [2023-12-25 07:23:08,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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:23:08,537 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 24 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:08,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 793 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:08,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2023-12-25 07:23:08,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 288. [2023-12-25 07:23:08,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 226 states have (on average 1.420353982300885) internal successors, (321), 230 states have internal predecessors, (321), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2023-12-25 07:23:08,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 423 transitions. [2023-12-25 07:23:08,556 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 423 transitions. Word has length 56 [2023-12-25 07:23:08,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:08,557 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 423 transitions. [2023-12-25 07:23:08,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 07:23:08,557 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 423 transitions. [2023-12-25 07:23:08,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-25 07:23:08,558 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:08,558 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:23:08,566 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:23:08,761 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:23:08,761 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:08,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:08,762 INFO L85 PathProgramCache]: Analyzing trace with hash -902529464, now seen corresponding path program 1 times [2023-12-25 07:23:08,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:08,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536172665] [2023-12-25 07:23:08,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:08,762 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:23:08,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:08,764 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:23:08,765 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:23:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:08,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:23:08,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:08,846 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-25 07:23:08,846 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:08,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:08,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536172665] [2023-12-25 07:23:08,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536172665] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:08,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:08,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:23:08,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752545596] [2023-12-25 07:23:08,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:08,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:23:08,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:08,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:23:08,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:23:08,848 INFO L87 Difference]: Start difference. First operand 288 states and 423 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 07:23:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:08,878 INFO L93 Difference]: Finished difference Result 526 states and 786 transitions. [2023-12-25 07:23:08,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:23:08,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 74 [2023-12-25 07:23:08,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:08,880 INFO L225 Difference]: With dead ends: 526 [2023-12-25 07:23:08,880 INFO L226 Difference]: Without dead ends: 290 [2023-12-25 07:23:08,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:23:08,881 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 0 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:08,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1059 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:08,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-12-25 07:23:08,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2023-12-25 07:23:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 226 states have (on average 1.407079646017699) internal successors, (318), 230 states have internal predecessors, (318), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2023-12-25 07:23:08,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 420 transitions. [2023-12-25 07:23:08,892 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 420 transitions. Word has length 74 [2023-12-25 07:23:08,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:08,892 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 420 transitions. [2023-12-25 07:23:08,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 07:23:08,893 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 420 transitions. [2023-12-25 07:23:08,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-25 07:23:08,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:08,893 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:23:08,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-25 07:23:09,096 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:23:09,096 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:09,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:09,097 INFO L85 PathProgramCache]: Analyzing trace with hash 409416605, now seen corresponding path program 1 times [2023-12-25 07:23:09,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:09,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440490577] [2023-12-25 07:23:09,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:09,097 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:23:09,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:09,099 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:23:09,129 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:23:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:09,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:23:09,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:09,190 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2023-12-25 07:23:09,190 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:09,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:09,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440490577] [2023-12-25 07:23:09,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440490577] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:09,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:09,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:23:09,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114005376] [2023-12-25 07:23:09,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:09,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:23:09,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:09,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:23:09,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:23:09,192 INFO L87 Difference]: Start difference. First operand 288 states and 420 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 07:23:09,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:09,233 INFO L93 Difference]: Finished difference Result 563 states and 842 transitions. [2023-12-25 07:23:09,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:23:09,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 103 [2023-12-25 07:23:09,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:09,235 INFO L225 Difference]: With dead ends: 563 [2023-12-25 07:23:09,235 INFO L226 Difference]: Without dead ends: 332 [2023-12-25 07:23:09,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 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:23:09,237 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 25 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:09,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 793 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-12-25 07:23:09,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 329. [2023-12-25 07:23:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 263 states have (on average 1.3688212927756653) internal successors, (360), 267 states have internal predecessors, (360), 54 states have call successors, (54), 11 states have call predecessors, (54), 11 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-25 07:23:09,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 468 transitions. [2023-12-25 07:23:09,248 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 468 transitions. Word has length 103 [2023-12-25 07:23:09,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:09,248 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 468 transitions. [2023-12-25 07:23:09,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 07:23:09,248 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 468 transitions. [2023-12-25 07:23:09,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-25 07:23:09,249 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:09,249 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:23:09,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 07:23:09,452 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:23:09,452 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:09,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:09,453 INFO L85 PathProgramCache]: Analyzing trace with hash 2011171551, now seen corresponding path program 1 times [2023-12-25 07:23:09,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:09,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955450333] [2023-12-25 07:23:09,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:09,454 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:23:09,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:09,455 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:23:09,488 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:23:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:09,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:23:09,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:09,550 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2023-12-25 07:23:09,551 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:09,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:09,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955450333] [2023-12-25 07:23:09,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955450333] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:09,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:09,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:23:09,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755015554] [2023-12-25 07:23:09,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:09,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:23:09,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:09,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:23:09,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:23:09,552 INFO L87 Difference]: Start difference. First operand 329 states and 468 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 07:23:09,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:09,593 INFO L93 Difference]: Finished difference Result 589 states and 862 transitions. [2023-12-25 07:23:09,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:23:09,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2023-12-25 07:23:09,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:09,596 INFO L225 Difference]: With dead ends: 589 [2023-12-25 07:23:09,596 INFO L226 Difference]: Without dead ends: 323 [2023-12-25 07:23:09,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 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:23:09,597 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 15 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:09,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 753 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:09,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2023-12-25 07:23:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2023-12-25 07:23:09,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 258 states have (on average 1.3488372093023255) internal successors, (348), 262 states have internal predecessors, (348), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-25 07:23:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 454 transitions. [2023-12-25 07:23:09,610 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 454 transitions. Word has length 104 [2023-12-25 07:23:09,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:09,610 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 454 transitions. [2023-12-25 07:23:09,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 07:23:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 454 transitions. [2023-12-25 07:23:09,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-25 07:23:09,611 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:09,612 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:23:09,617 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:23:09,815 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:23:09,815 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:09,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:09,815 INFO L85 PathProgramCache]: Analyzing trace with hash 729266431, now seen corresponding path program 1 times [2023-12-25 07:23:09,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:09,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454906439] [2023-12-25 07:23:09,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:09,816 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:23:09,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:09,817 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:23:09,821 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:23:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:09,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:23:09,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2023-12-25 07:23:09,926 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:09,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:09,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454906439] [2023-12-25 07:23:09,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454906439] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:09,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:09,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:23:09,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380887344] [2023-12-25 07:23:09,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:09,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:23:09,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:09,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:23:09,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:23:09,928 INFO L87 Difference]: Start difference. First operand 323 states and 454 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-25 07:23:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:09,950 INFO L93 Difference]: Finished difference Result 564 states and 811 transitions. [2023-12-25 07:23:09,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:23:09,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 123 [2023-12-25 07:23:09,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:09,952 INFO L225 Difference]: With dead ends: 564 [2023-12-25 07:23:09,952 INFO L226 Difference]: Without dead ends: 325 [2023-12-25 07:23:09,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:23:09,953 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:09,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1043 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:09,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2023-12-25 07:23:09,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2023-12-25 07:23:09,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 258 states have (on average 1.3372093023255813) internal successors, (345), 262 states have internal predecessors, (345), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-25 07:23:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 451 transitions. [2023-12-25 07:23:09,965 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 451 transitions. Word has length 123 [2023-12-25 07:23:09,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:09,965 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 451 transitions. [2023-12-25 07:23:09,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-25 07:23:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 451 transitions. [2023-12-25 07:23:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-25 07:23:09,967 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:09,967 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 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, 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:23:09,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-25 07:23:10,170 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:23:10,171 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:10,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:10,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1010125850, now seen corresponding path program 1 times [2023-12-25 07:23:10,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:10,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215796665] [2023-12-25 07:23:10,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:10,172 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:23:10,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:10,189 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:23:10,232 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:23:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:10,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:23:10,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2023-12-25 07:23:10,303 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:10,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:10,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215796665] [2023-12-25 07:23:10,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215796665] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:10,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:10,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:23:10,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122987713] [2023-12-25 07:23:10,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:10,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:23:10,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:10,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:23:10,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:23:10,305 INFO L87 Difference]: Start difference. First operand 323 states and 451 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-25 07:23:10,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:10,349 INFO L93 Difference]: Finished difference Result 527 states and 771 transitions. [2023-12-25 07:23:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:23:10,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 156 [2023-12-25 07:23:10,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:10,351 INFO L225 Difference]: With dead ends: 527 [2023-12-25 07:23:10,351 INFO L226 Difference]: Without dead ends: 321 [2023-12-25 07:23:10,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 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:23:10,352 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 13 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:10,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 721 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:10,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-12-25 07:23:10,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2023-12-25 07:23:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 257 states have (on average 1.3346303501945525) internal successors, (343), 261 states have internal predecessors, (343), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-25 07:23:10,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 447 transitions. [2023-12-25 07:23:10,364 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 447 transitions. Word has length 156 [2023-12-25 07:23:10,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:10,364 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 447 transitions. [2023-12-25 07:23:10,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-25 07:23:10,365 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 447 transitions. [2023-12-25 07:23:10,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-25 07:23:10,366 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:10,367 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:23:10,385 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:23:10,570 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:23:10,570 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:10,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:10,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1148747676, now seen corresponding path program 1 times [2023-12-25 07:23:10,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:10,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539989239] [2023-12-25 07:23:10,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:10,572 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:23:10,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:10,573 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:23:10,600 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:23:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:10,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:23:10,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:10,687 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2023-12-25 07:23:10,688 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:10,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:10,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539989239] [2023-12-25 07:23:10,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539989239] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:10,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:10,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:23:10,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406436609] [2023-12-25 07:23:10,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:10,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:23:10,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:10,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:23:10,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:23:10,689 INFO L87 Difference]: Start difference. First operand 321 states and 447 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-25 07:23:10,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:10,733 INFO L93 Difference]: Finished difference Result 467 states and 667 transitions. [2023-12-25 07:23:10,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:23:10,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 175 [2023-12-25 07:23:10,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:10,735 INFO L225 Difference]: With dead ends: 467 [2023-12-25 07:23:10,735 INFO L226 Difference]: Without dead ends: 304 [2023-12-25 07:23:10,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 173 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:23:10,736 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 35 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:10,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 702 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:10,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-12-25 07:23:10,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2023-12-25 07:23:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 243 states have (on average 1.3251028806584362) internal successors, (322), 247 states have internal predecessors, (322), 49 states have call successors, (49), 11 states have call predecessors, (49), 11 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2023-12-25 07:23:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 420 transitions. [2023-12-25 07:23:10,747 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 420 transitions. Word has length 175 [2023-12-25 07:23:10,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:10,747 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 420 transitions. [2023-12-25 07:23:10,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-25 07:23:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 420 transitions. [2023-12-25 07:23:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-12-25 07:23:10,748 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:10,749 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:23:10,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-25 07:23:10,952 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:23:10,952 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:10,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:10,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1147940708, now seen corresponding path program 1 times [2023-12-25 07:23:10,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:10,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398219071] [2023-12-25 07:23:10,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:10,954 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:23:10,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:10,955 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:23:10,987 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:23:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:11,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:23:11,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:11,078 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2023-12-25 07:23:11,078 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:11,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:11,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398219071] [2023-12-25 07:23:11,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398219071] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:11,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:11,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:23:11,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183122908] [2023-12-25 07:23:11,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:11,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:23:11,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:11,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:23:11,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:23:11,080 INFO L87 Difference]: Start difference. First operand 304 states and 420 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-25 07:23:11,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:11,127 INFO L93 Difference]: Finished difference Result 450 states and 640 transitions. [2023-12-25 07:23:11,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:23:11,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 177 [2023-12-25 07:23:11,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:11,129 INFO L225 Difference]: With dead ends: 450 [2023-12-25 07:23:11,129 INFO L226 Difference]: Without dead ends: 285 [2023-12-25 07:23:11,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 175 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:23:11,130 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 30 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:11,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 706 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:11,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-12-25 07:23:11,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2023-12-25 07:23:11,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 227 states have (on average 1.3171806167400881) internal successors, (299), 231 states have internal predecessors, (299), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-25 07:23:11,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 391 transitions. [2023-12-25 07:23:11,141 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 391 transitions. Word has length 177 [2023-12-25 07:23:11,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:11,141 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 391 transitions. [2023-12-25 07:23:11,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-25 07:23:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 391 transitions. [2023-12-25 07:23:11,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-12-25 07:23:11,143 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:11,143 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:23:11,156 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:23:11,346 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:23:11,346 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:11,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:11,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1334746545, now seen corresponding path program 1 times [2023-12-25 07:23:11,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:11,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503190180] [2023-12-25 07:23:11,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:11,347 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:23:11,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:11,348 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:23:11,353 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:23:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:11,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:23:11,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:11,494 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2023-12-25 07:23:11,494 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:11,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:11,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503190180] [2023-12-25 07:23:11,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503190180] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:11,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:11,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:23:11,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131376878] [2023-12-25 07:23:11,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:11,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:23:11,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:11,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:23:11,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:23:11,495 INFO L87 Difference]: Start difference. First operand 285 states and 391 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-25 07:23:11,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:11,519 INFO L93 Difference]: Finished difference Result 430 states and 610 transitions. [2023-12-25 07:23:11,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:23:11,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 178 [2023-12-25 07:23:11,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:11,521 INFO L225 Difference]: With dead ends: 430 [2023-12-25 07:23:11,521 INFO L226 Difference]: Without dead ends: 285 [2023-12-25 07:23:11,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:23:11,522 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 0 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:11,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1021 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:11,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-12-25 07:23:11,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2023-12-25 07:23:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 227 states have (on average 1.2907488986784141) internal successors, (293), 231 states have internal predecessors, (293), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-25 07:23:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 385 transitions. [2023-12-25 07:23:11,535 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 385 transitions. Word has length 178 [2023-12-25 07:23:11,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:11,535 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 385 transitions. [2023-12-25 07:23:11,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-25 07:23:11,536 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 385 transitions. [2023-12-25 07:23:11,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-25 07:23:11,552 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:11,553 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:23:11,559 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:23:11,756 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:23:11,757 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:11,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:11,757 INFO L85 PathProgramCache]: Analyzing trace with hash 465461795, now seen corresponding path program 1 times [2023-12-25 07:23:11,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:11,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485051810] [2023-12-25 07:23:11,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:11,758 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:23:11,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:11,759 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:23:11,802 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:23:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:11,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:23:11,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:11,906 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2023-12-25 07:23:11,906 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:23:11,984 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2023-12-25 07:23:11,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:11,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485051810] [2023-12-25 07:23:11,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485051810] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 07:23:11,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 07:23:11,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-12-25 07:23:11,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426208623] [2023-12-25 07:23:11,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:11,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:23:11,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:11,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:23:11,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:23:11,986 INFO L87 Difference]: Start difference. First operand 285 states and 385 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-25 07:23:12,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:12,020 INFO L93 Difference]: Finished difference Result 451 states and 632 transitions. [2023-12-25 07:23:12,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:23:12,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 185 [2023-12-25 07:23:12,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:12,022 INFO L225 Difference]: With dead ends: 451 [2023-12-25 07:23:12,022 INFO L226 Difference]: Without dead ends: 264 [2023-12-25 07:23:12,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 365 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:23:12,023 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 30 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:12,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 483 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:12,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-12-25 07:23:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2023-12-25 07:23:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 209 states have (on average 1.2822966507177034) internal successors, (268), 213 states have internal predecessors, (268), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2023-12-25 07:23:12,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 354 transitions. [2023-12-25 07:23:12,033 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 354 transitions. Word has length 185 [2023-12-25 07:23:12,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:12,033 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 354 transitions. [2023-12-25 07:23:12,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-25 07:23:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 354 transitions. [2023-12-25 07:23:12,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-12-25 07:23:12,034 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:12,035 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:23:12,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-25 07:23:12,238 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:23:12,238 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:12,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:12,239 INFO L85 PathProgramCache]: Analyzing trace with hash -495297002, now seen corresponding path program 1 times [2023-12-25 07:23:12,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:12,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157375067] [2023-12-25 07:23:12,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:12,239 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:23:12,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:12,240 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:23:12,242 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:23:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:12,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:23:12,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2023-12-25 07:23:12,366 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:12,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:12,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157375067] [2023-12-25 07:23:12,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1157375067] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:12,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:12,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:23:12,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255564888] [2023-12-25 07:23:12,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:12,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:23:12,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:12,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:23:12,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:23:12,367 INFO L87 Difference]: Start difference. First operand 264 states and 354 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-25 07:23:12,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:12,396 INFO L93 Difference]: Finished difference Result 408 states and 573 transitions. [2023-12-25 07:23:12,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:23:12,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 209 [2023-12-25 07:23:12,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:12,398 INFO L225 Difference]: With dead ends: 408 [2023-12-25 07:23:12,398 INFO L226 Difference]: Without dead ends: 270 [2023-12-25 07:23:12,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 206 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:23:12,399 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 6 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:12,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 746 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:12,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-12-25 07:23:12,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 268. [2023-12-25 07:23:12,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 212 states have (on average 1.278301886792453) internal successors, (271), 216 states have internal predecessors, (271), 43 states have call successors, (43), 12 states have call predecessors, (43), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2023-12-25 07:23:12,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 357 transitions. [2023-12-25 07:23:12,408 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 357 transitions. Word has length 209 [2023-12-25 07:23:12,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:12,409 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 357 transitions. [2023-12-25 07:23:12,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-25 07:23:12,409 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 357 transitions. [2023-12-25 07:23:12,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-25 07:23:12,410 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:12,410 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:23:12,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-12-25 07:23:12,613 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:23:12,614 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:12,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:12,614 INFO L85 PathProgramCache]: Analyzing trace with hash 26463700, now seen corresponding path program 1 times [2023-12-25 07:23:12,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:12,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596834473] [2023-12-25 07:23:12,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:12,615 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:23:12,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:12,616 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:23:12,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 (20)] Waiting until timeout for monitored process [2023-12-25 07:23:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:12,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:23:12,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:12,730 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2023-12-25 07:23:12,730 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:12,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:12,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596834473] [2023-12-25 07:23:12,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596834473] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:12,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:12,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:23:12,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397876358] [2023-12-25 07:23:12,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:12,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:23:12,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:12,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:23:12,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:23:12,732 INFO L87 Difference]: Start difference. First operand 268 states and 357 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-25 07:23:12,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:12,771 INFO L93 Difference]: Finished difference Result 417 states and 580 transitions. [2023-12-25 07:23:12,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:23:12,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 216 [2023-12-25 07:23:12,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:12,773 INFO L225 Difference]: With dead ends: 417 [2023-12-25 07:23:12,773 INFO L226 Difference]: Without dead ends: 275 [2023-12-25 07:23:12,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 214 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:23:12,774 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 7 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:12,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 751 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:12,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2023-12-25 07:23:12,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2023-12-25 07:23:12,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 216 states have (on average 1.2731481481481481) internal successors, (275), 220 states have internal predecessors, (275), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2023-12-25 07:23:12,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 361 transitions. [2023-12-25 07:23:12,783 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 361 transitions. Word has length 216 [2023-12-25 07:23:12,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:12,800 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 361 transitions. [2023-12-25 07:23:12,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-25 07:23:12,801 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 361 transitions. [2023-12-25 07:23:12,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-12-25 07:23:12,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:12,803 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:23:12,822 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:23:13,004 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:23:13,004 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:13,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:13,004 INFO L85 PathProgramCache]: Analyzing trace with hash 2109828368, now seen corresponding path program 1 times [2023-12-25 07:23:13,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:13,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025719644] [2023-12-25 07:23:13,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:13,005 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:23:13,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:13,006 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:23:13,007 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:23:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:13,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:23:13,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2023-12-25 07:23:13,141 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:13,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:13,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025719644] [2023-12-25 07:23:13,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1025719644] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:13,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:13,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:23:13,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852619237] [2023-12-25 07:23:13,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:13,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:23:13,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:13,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:23:13,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:23:13,142 INFO L87 Difference]: Start difference. First operand 273 states and 361 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-25 07:23:13,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:13,172 INFO L93 Difference]: Finished difference Result 419 states and 578 transitions. [2023-12-25 07:23:13,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:23:13,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 224 [2023-12-25 07:23:13,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:13,173 INFO L225 Difference]: With dead ends: 419 [2023-12-25 07:23:13,173 INFO L226 Difference]: Without dead ends: 272 [2023-12-25 07:23:13,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 222 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:23:13,174 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 7 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:13,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 737 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:13,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2023-12-25 07:23:13,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2023-12-25 07:23:13,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 216 states have (on average 1.2592592592592593) internal successors, (272), 219 states have internal predecessors, (272), 42 states have call successors, (42), 13 states have call predecessors, (42), 13 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-25 07:23:13,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 356 transitions. [2023-12-25 07:23:13,183 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 356 transitions. Word has length 224 [2023-12-25 07:23:13,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:13,183 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 356 transitions. [2023-12-25 07:23:13,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-25 07:23:13,183 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 356 transitions. [2023-12-25 07:23:13,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2023-12-25 07:23:13,185 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:13,185 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:13,196 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:23:13,389 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:23:13,389 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:13,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:13,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1267556848, now seen corresponding path program 1 times [2023-12-25 07:23:13,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:13,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133081476] [2023-12-25 07:23:13,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:13,390 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:23:13,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:13,392 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:23:13,394 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:23:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:13,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:23:13,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:13,518 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2023-12-25 07:23:13,518 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:13,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:13,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133081476] [2023-12-25 07:23:13,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133081476] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:13,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:13,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:23:13,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422640953] [2023-12-25 07:23:13,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:13,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:23:13,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:13,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:23:13,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:23:13,521 INFO L87 Difference]: Start difference. First operand 272 states and 356 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-25 07:23:13,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:13,536 INFO L93 Difference]: Finished difference Result 417 states and 567 transitions. [2023-12-25 07:23:13,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:23:13,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 232 [2023-12-25 07:23:13,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:13,538 INFO L225 Difference]: With dead ends: 417 [2023-12-25 07:23:13,538 INFO L226 Difference]: Without dead ends: 271 [2023-12-25 07:23:13,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 230 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:23:13,539 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 1 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:13,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 493 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:13,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-12-25 07:23:13,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2023-12-25 07:23:13,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 216 states have (on average 1.2546296296296295) internal successors, (271), 218 states have internal predecessors, (271), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-25 07:23:13,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 353 transitions. [2023-12-25 07:23:13,551 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 353 transitions. Word has length 232 [2023-12-25 07:23:13,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:13,551 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 353 transitions. [2023-12-25 07:23:13,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-25 07:23:13,552 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 353 transitions. [2023-12-25 07:23:13,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2023-12-25 07:23:13,554 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:13,554 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:13,574 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:23:13,758 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:23:13,758 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:13,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:13,758 INFO L85 PathProgramCache]: Analyzing trace with hash 607537049, now seen corresponding path program 1 times [2023-12-25 07:23:13,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:13,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094148946] [2023-12-25 07:23:13,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:13,759 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:23:13,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:13,762 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:23:13,762 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:23:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:13,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 07:23:13,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:14,254 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2023-12-25 07:23:14,254 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:14,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:14,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094148946] [2023-12-25 07:23:14,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094148946] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:14,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:14,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:23:14,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270391354] [2023-12-25 07:23:14,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:14,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:23:14,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:14,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:23:14,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:23:14,256 INFO L87 Difference]: Start difference. First operand 271 states and 353 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (13), 3 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:23:14,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:14,447 INFO L93 Difference]: Finished difference Result 602 states and 818 transitions. [2023-12-25 07:23:14,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 07:23:14,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (13), 3 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 233 [2023-12-25 07:23:14,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:14,450 INFO L225 Difference]: With dead ends: 602 [2023-12-25 07:23:14,450 INFO L226 Difference]: Without dead ends: 457 [2023-12-25 07:23:14,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-25 07:23:14,452 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 513 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:14,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 757 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:23:14,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2023-12-25 07:23:14,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 451. [2023-12-25 07:23:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 353 states have (on average 1.3059490084985836) internal successors, (461), 355 states have internal predecessors, (461), 70 states have call successors, (70), 27 states have call predecessors, (70), 27 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2023-12-25 07:23:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 601 transitions. [2023-12-25 07:23:14,474 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 601 transitions. Word has length 233 [2023-12-25 07:23:14,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:14,475 INFO L495 AbstractCegarLoop]: Abstraction has 451 states and 601 transitions. [2023-12-25 07:23:14,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (13), 3 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:23:14,476 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 601 transitions. [2023-12-25 07:23:14,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2023-12-25 07:23:14,477 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:14,478 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 3, 3, 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] [2023-12-25 07:23:14,504 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:23:14,682 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:23:14,683 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:14,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:14,683 INFO L85 PathProgramCache]: Analyzing trace with hash 645496333, now seen corresponding path program 1 times [2023-12-25 07:23:14,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:14,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659437527] [2023-12-25 07:23:14,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:14,684 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:23:14,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:14,685 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:23:14,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-25 07:23:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:14,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:23:14,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2023-12-25 07:23:14,867 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:14,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:14,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659437527] [2023-12-25 07:23:14,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659437527] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:14,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:14,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:23:14,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647806481] [2023-12-25 07:23:14,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:14,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:23:14,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:14,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:23:14,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:23:14,869 INFO L87 Difference]: Start difference. First operand 451 states and 601 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-25 07:23:14,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:14,918 INFO L93 Difference]: Finished difference Result 1011 states and 1391 transitions. [2023-12-25 07:23:14,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:23:14,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 265 [2023-12-25 07:23:14,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:14,921 INFO L225 Difference]: With dead ends: 1011 [2023-12-25 07:23:14,921 INFO L226 Difference]: Without dead ends: 738 [2023-12-25 07:23:14,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 263 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:23:14,923 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 164 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:14,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 519 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:14,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2023-12-25 07:23:14,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 644. [2023-12-25 07:23:14,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 502 states have (on average 1.3326693227091633) internal successors, (669), 508 states have internal predecessors, (669), 100 states have call successors, (100), 41 states have call predecessors, (100), 41 states have return successors, (100), 96 states have call predecessors, (100), 100 states have call successors, (100) [2023-12-25 07:23:14,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 869 transitions. [2023-12-25 07:23:14,952 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 869 transitions. Word has length 265 [2023-12-25 07:23:14,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:14,953 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 869 transitions. [2023-12-25 07:23:14,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-25 07:23:14,953 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 869 transitions. [2023-12-25 07:23:14,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2023-12-25 07:23:14,955 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:14,956 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 3, 3, 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] [2023-12-25 07:23:14,972 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:23:15,159 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:23:15,161 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:15,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:15,161 INFO L85 PathProgramCache]: Analyzing trace with hash 594321832, now seen corresponding path program 1 times [2023-12-25 07:23:15,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:15,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171126876] [2023-12-25 07:23:15,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:15,162 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:23:15,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:15,163 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:23:15,240 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:23:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:15,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:23:15,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:15,363 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-25 07:23:15,363 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:15,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:15,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171126876] [2023-12-25 07:23:15,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171126876] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:15,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:15,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:23:15,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938966563] [2023-12-25 07:23:15,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:15,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:23:15,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:15,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:23:15,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:23:15,365 INFO L87 Difference]: Start difference. First operand 644 states and 869 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-25 07:23:15,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:15,412 INFO L93 Difference]: Finished difference Result 1501 states and 2078 transitions. [2023-12-25 07:23:15,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:23:15,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 266 [2023-12-25 07:23:15,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:15,416 INFO L225 Difference]: With dead ends: 1501 [2023-12-25 07:23:15,416 INFO L226 Difference]: Without dead ends: 1074 [2023-12-25 07:23:15,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 264 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:23:15,418 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 168 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:15,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 535 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:15,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2023-12-25 07:23:15,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 991. [2023-12-25 07:23:15,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 769 states have (on average 1.3524057217165149) internal successors, (1040), 783 states have internal predecessors, (1040), 154 states have call successors, (154), 67 states have call predecessors, (154), 67 states have return successors, (154), 144 states have call predecessors, (154), 154 states have call successors, (154) [2023-12-25 07:23:15,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1348 transitions. [2023-12-25 07:23:15,463 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1348 transitions. Word has length 266 [2023-12-25 07:23:15,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:15,464 INFO L495 AbstractCegarLoop]: Abstraction has 991 states and 1348 transitions. [2023-12-25 07:23:15,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-25 07:23:15,465 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1348 transitions. [2023-12-25 07:23:15,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2023-12-25 07:23:15,466 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:15,467 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 3, 3, 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:23:15,482 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:23:15,671 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:23:15,672 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:15,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:15,672 INFO L85 PathProgramCache]: Analyzing trace with hash 169478984, now seen corresponding path program 1 times [2023-12-25 07:23:15,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:15,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706038659] [2023-12-25 07:23:15,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:15,673 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:23:15,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:15,674 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:23:15,676 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:23:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:15,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:23:15,825 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:15,840 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2023-12-25 07:23:15,840 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:15,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:15,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706038659] [2023-12-25 07:23:15,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706038659] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:15,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:15,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:23:15,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730967056] [2023-12-25 07:23:15,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:15,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:23:15,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:15,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:23:15,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:23:15,842 INFO L87 Difference]: Start difference. First operand 991 states and 1348 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-25 07:23:15,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:15,937 INFO L93 Difference]: Finished difference Result 2275 states and 3162 transitions. [2023-12-25 07:23:15,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:23:15,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 267 [2023-12-25 07:23:15,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:15,943 INFO L225 Difference]: With dead ends: 2275 [2023-12-25 07:23:15,944 INFO L226 Difference]: Without dead ends: 1646 [2023-12-25 07:23:15,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 265 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:23:15,948 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 175 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:15,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 552 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:15,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2023-12-25 07:23:16,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1557. [2023-12-25 07:23:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1203 states have (on average 1.373233582709892) internal successors, (1652), 1231 states have internal predecessors, (1652), 246 states have call successors, (246), 107 states have call predecessors, (246), 107 states have return successors, (246), 226 states have call predecessors, (246), 246 states have call successors, (246) [2023-12-25 07:23:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2144 transitions. [2023-12-25 07:23:16,027 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2144 transitions. Word has length 267 [2023-12-25 07:23:16,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:16,028 INFO L495 AbstractCegarLoop]: Abstraction has 1557 states and 2144 transitions. [2023-12-25 07:23:16,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-25 07:23:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2144 transitions. [2023-12-25 07:23:16,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2023-12-25 07:23:16,030 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:16,030 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 3, 3, 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:23:16,049 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:23:16,234 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:23:16,235 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:16,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:16,235 INFO L85 PathProgramCache]: Analyzing trace with hash -224887802, now seen corresponding path program 1 times [2023-12-25 07:23:16,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:16,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334513682] [2023-12-25 07:23:16,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:16,236 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:23:16,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:16,240 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:23:16,242 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:23:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:16,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:23:16,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:16,420 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2023-12-25 07:23:16,420 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:16,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:16,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334513682] [2023-12-25 07:23:16,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334513682] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:16,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:16,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:23:16,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584560019] [2023-12-25 07:23:16,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:16,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:23:16,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:16,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:23:16,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:23:16,423 INFO L87 Difference]: Start difference. First operand 1557 states and 2144 transitions. Second operand has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-25 07:23:16,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:16,547 INFO L93 Difference]: Finished difference Result 2503 states and 3482 transitions. [2023-12-25 07:23:16,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:23:16,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 267 [2023-12-25 07:23:16,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:16,554 INFO L225 Difference]: With dead ends: 2503 [2023-12-25 07:23:16,554 INFO L226 Difference]: Without dead ends: 1528 [2023-12-25 07:23:16,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 263 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:23:16,557 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 2 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:16,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 949 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:16,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2023-12-25 07:23:16,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1528. [2023-12-25 07:23:16,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1528 states, 1179 states have (on average 1.368108566581849) internal successors, (1613), 1204 states have internal predecessors, (1613), 244 states have call successors, (244), 105 states have call predecessors, (244), 104 states have return successors, (243), 225 states have call predecessors, (243), 243 states have call successors, (243) [2023-12-25 07:23:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 2100 transitions. [2023-12-25 07:23:16,649 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 2100 transitions. Word has length 267 [2023-12-25 07:23:16,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:16,649 INFO L495 AbstractCegarLoop]: Abstraction has 1528 states and 2100 transitions. [2023-12-25 07:23:16,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-25 07:23:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2100 transitions. [2023-12-25 07:23:16,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2023-12-25 07:23:16,652 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:16,652 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:16,680 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:23:16,856 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:23:16,857 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:16,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:16,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1922810785, now seen corresponding path program 1 times [2023-12-25 07:23:16,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:16,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752053712] [2023-12-25 07:23:16,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:16,858 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:23:16,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:16,859 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:23:16,893 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:23:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:17,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:23:17,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:17,025 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2023-12-25 07:23:17,025 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:17,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:17,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752053712] [2023-12-25 07:23:17,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752053712] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:17,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:17,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:23:17,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767408903] [2023-12-25 07:23:17,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:17,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:23:17,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:17,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:23:17,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:23:17,027 INFO L87 Difference]: Start difference. First operand 1528 states and 2100 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-25 07:23:17,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:17,163 INFO L93 Difference]: Finished difference Result 3116 states and 4300 transitions. [2023-12-25 07:23:17,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:23:17,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 272 [2023-12-25 07:23:17,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:17,170 INFO L225 Difference]: With dead ends: 3116 [2023-12-25 07:23:17,170 INFO L226 Difference]: Without dead ends: 1546 [2023-12-25 07:23:17,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 269 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:23:17,174 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 33 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:17,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 651 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2023-12-25 07:23:17,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1546. [2023-12-25 07:23:17,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1194 states have (on average 1.3433835845896147) internal successors, (1604), 1219 states have internal predecessors, (1604), 244 states have call successors, (244), 108 states have call predecessors, (244), 107 states have return successors, (243), 225 states have call predecessors, (243), 243 states have call successors, (243) [2023-12-25 07:23:17,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2091 transitions. [2023-12-25 07:23:17,241 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2091 transitions. Word has length 272 [2023-12-25 07:23:17,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:17,241 INFO L495 AbstractCegarLoop]: Abstraction has 1546 states and 2091 transitions. [2023-12-25 07:23:17,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-25 07:23:17,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2091 transitions. [2023-12-25 07:23:17,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2023-12-25 07:23:17,243 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:17,243 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:17,258 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:23:17,447 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:23:17,448 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:17,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:17,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1792787534, now seen corresponding path program 1 times [2023-12-25 07:23:17,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:17,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489205693] [2023-12-25 07:23:17,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:17,449 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:23:17,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:17,450 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:23:17,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-25 07:23:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:17,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 07:23:17,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:17,992 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 54 proven. 100 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2023-12-25 07:23:17,992 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:23:18,298 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 20 proven. 144 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2023-12-25 07:23:18,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:18,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489205693] [2023-12-25 07:23:18,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489205693] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:23:18,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:23:18,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2023-12-25 07:23:18,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827632465] [2023-12-25 07:23:18,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:23:18,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 07:23:18,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:18,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 07:23:18,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2023-12-25 07:23:18,300 INFO L87 Difference]: Start difference. First operand 1546 states and 2091 transitions. Second operand has 21 states, 21 states have (on average 7.333333333333333) internal successors, (154), 18 states have internal predecessors, (154), 5 states have call successors, (35), 8 states have call predecessors, (35), 12 states have return successors, (35), 7 states have call predecessors, (35), 5 states have call successors, (35) [2023-12-25 07:23:19,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:19,536 INFO L93 Difference]: Finished difference Result 3036 states and 4188 transitions. [2023-12-25 07:23:19,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 07:23:19,538 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.333333333333333) internal successors, (154), 18 states have internal predecessors, (154), 5 states have call successors, (35), 8 states have call predecessors, (35), 12 states have return successors, (35), 7 states have call predecessors, (35), 5 states have call successors, (35) Word has length 273 [2023-12-25 07:23:19,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:19,544 INFO L225 Difference]: With dead ends: 3036 [2023-12-25 07:23:19,544 INFO L226 Difference]: Without dead ends: 1874 [2023-12-25 07:23:19,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 530 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=1104, Unknown=0, NotChecked=0, Total=1332 [2023-12-25 07:23:19,547 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 567 mSDsluCounter, 2381 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 2578 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:19,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 2578 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 07:23:19,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2023-12-25 07:23:19,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1590. [2023-12-25 07:23:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1230 states have (on average 1.3333333333333333) internal successors, (1640), 1252 states have internal predecessors, (1640), 241 states have call successors, (241), 115 states have call predecessors, (241), 118 states have return successors, (248), 229 states have call predecessors, (248), 240 states have call successors, (248) [2023-12-25 07:23:19,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 2129 transitions. [2023-12-25 07:23:19,621 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 2129 transitions. Word has length 273 [2023-12-25 07:23:19,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:19,621 INFO L495 AbstractCegarLoop]: Abstraction has 1590 states and 2129 transitions. [2023-12-25 07:23:19,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.333333333333333) internal successors, (154), 18 states have internal predecessors, (154), 5 states have call successors, (35), 8 states have call predecessors, (35), 12 states have return successors, (35), 7 states have call predecessors, (35), 5 states have call successors, (35) [2023-12-25 07:23:19,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2129 transitions. [2023-12-25 07:23:19,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2023-12-25 07:23:19,623 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:19,623 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:19,628 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:23:19,827 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:23:19,827 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:19,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:19,827 INFO L85 PathProgramCache]: Analyzing trace with hash -831173517, now seen corresponding path program 1 times [2023-12-25 07:23:19,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:19,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394293313] [2023-12-25 07:23:19,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:19,828 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:23:19,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:19,829 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:23:19,830 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:23:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:19,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:23:19,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2023-12-25 07:23:20,017 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:20,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:20,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394293313] [2023-12-25 07:23:20,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394293313] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:20,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:20,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:23:20,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086884770] [2023-12-25 07:23:20,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:20,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:23:20,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:20,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:23:20,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:23:20,019 INFO L87 Difference]: Start difference. First operand 1590 states and 2129 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-25 07:23:20,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:20,154 INFO L93 Difference]: Finished difference Result 2866 states and 3907 transitions. [2023-12-25 07:23:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:23:20,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 273 [2023-12-25 07:23:20,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:20,161 INFO L225 Difference]: With dead ends: 2866 [2023-12-25 07:23:20,161 INFO L226 Difference]: Without dead ends: 1574 [2023-12-25 07:23:20,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 271 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:23:20,164 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 31 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:20,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 651 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:20,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2023-12-25 07:23:20,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1574. [2023-12-25 07:23:20,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1218 states have (on average 1.3111658456486042) internal successors, (1597), 1240 states have internal predecessors, (1597), 241 states have call successors, (241), 115 states have call predecessors, (241), 114 states have return successors, (240), 225 states have call predecessors, (240), 240 states have call successors, (240) [2023-12-25 07:23:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 2078 transitions. [2023-12-25 07:23:20,245 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 2078 transitions. Word has length 273 [2023-12-25 07:23:20,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:20,245 INFO L495 AbstractCegarLoop]: Abstraction has 1574 states and 2078 transitions. [2023-12-25 07:23:20,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-25 07:23:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 2078 transitions. [2023-12-25 07:23:20,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2023-12-25 07:23:20,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:20,247 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 7, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:20,253 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:23:20,451 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:23:20,451 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:20,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:20,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1580137485, now seen corresponding path program 1 times [2023-12-25 07:23:20,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:20,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258684573] [2023-12-25 07:23:20,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:20,452 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:23:20,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:20,453 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:23:20,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-25 07:23:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:20,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 07:23:20,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:20,881 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 263 proven. 113 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2023-12-25 07:23:20,882 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:23:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 65 proven. 126 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2023-12-25 07:23:21,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:21,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258684573] [2023-12-25 07:23:21,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258684573] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:23:21,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:23:21,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2023-12-25 07:23:21,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060715017] [2023-12-25 07:23:21,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:23:21,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 07:23:21,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:21,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 07:23:21,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2023-12-25 07:23:21,203 INFO L87 Difference]: Start difference. First operand 1574 states and 2078 transitions. Second operand has 21 states, 21 states have (on average 7.761904761904762) internal successors, (163), 18 states have internal predecessors, (163), 5 states have call successors, (35), 8 states have call predecessors, (35), 14 states have return successors, (35), 7 states have call predecessors, (35), 5 states have call successors, (35) [2023-12-25 07:23:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:22,606 INFO L93 Difference]: Finished difference Result 2893 states and 3888 transitions. [2023-12-25 07:23:22,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 07:23:22,607 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.761904761904762) internal successors, (163), 18 states have internal predecessors, (163), 5 states have call successors, (35), 8 states have call predecessors, (35), 14 states have return successors, (35), 7 states have call predecessors, (35), 5 states have call successors, (35) Word has length 283 [2023-12-25 07:23:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:22,613 INFO L225 Difference]: With dead ends: 2893 [2023-12-25 07:23:22,613 INFO L226 Difference]: Without dead ends: 1739 [2023-12-25 07:23:22,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 550 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=228, Invalid=1104, Unknown=0, NotChecked=0, Total=1332 [2023-12-25 07:23:22,616 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 597 mSDsluCounter, 2014 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:22,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 2189 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 1561 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 07:23:22,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2023-12-25 07:23:22,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1394. [2023-12-25 07:23:22,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1087 states have (on average 1.3063477460901565) internal successors, (1420), 1107 states have internal predecessors, (1420), 203 states have call successors, (203), 104 states have call predecessors, (203), 103 states have return successors, (202), 189 states have call predecessors, (202), 202 states have call successors, (202) [2023-12-25 07:23:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1825 transitions. [2023-12-25 07:23:22,692 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1825 transitions. Word has length 283 [2023-12-25 07:23:22,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:22,693 INFO L495 AbstractCegarLoop]: Abstraction has 1394 states and 1825 transitions. [2023-12-25 07:23:22,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.761904761904762) internal successors, (163), 18 states have internal predecessors, (163), 5 states have call successors, (35), 8 states have call predecessors, (35), 14 states have return successors, (35), 7 states have call predecessors, (35), 5 states have call successors, (35) [2023-12-25 07:23:22,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1825 transitions. [2023-12-25 07:23:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2023-12-25 07:23:22,694 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:22,695 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:22,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-12-25 07:23:22,898 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:23:22,899 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:22,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:22,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2063809600, now seen corresponding path program 1 times [2023-12-25 07:23:22,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:22,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053273140] [2023-12-25 07:23:22,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:22,901 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:23:22,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:22,902 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:23:22,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-12-25 07:23:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:23,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 07:23:23,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 373 proven. 82 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2023-12-25 07:23:23,321 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:23:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 119 proven. 80 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2023-12-25 07:23:23,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:23,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053273140] [2023-12-25 07:23:23,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053273140] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:23:23,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:23:23,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2023-12-25 07:23:23,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561936642] [2023-12-25 07:23:23,667 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:23:23,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 07:23:23,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:23,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 07:23:23,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2023-12-25 07:23:23,669 INFO L87 Difference]: Start difference. First operand 1394 states and 1825 transitions. Second operand has 19 states, 19 states have (on average 8.473684210526315) internal successors, (161), 16 states have internal predecessors, (161), 5 states have call successors, (35), 6 states have call predecessors, (35), 12 states have return successors, (35), 7 states have call predecessors, (35), 5 states have call successors, (35) [2023-12-25 07:23:24,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:24,656 INFO L93 Difference]: Finished difference Result 2574 states and 3451 transitions. [2023-12-25 07:23:24,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 07:23:24,656 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.473684210526315) internal successors, (161), 16 states have internal predecessors, (161), 5 states have call successors, (35), 6 states have call predecessors, (35), 12 states have return successors, (35), 7 states have call predecessors, (35), 5 states have call successors, (35) Word has length 294 [2023-12-25 07:23:24,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:24,662 INFO L225 Difference]: With dead ends: 2574 [2023-12-25 07:23:24,662 INFO L226 Difference]: Without dead ends: 1560 [2023-12-25 07:23:24,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 573 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:23:24,665 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 383 mSDsluCounter, 2668 mSDsCounter, 0 mSdLazyCounter, 1847 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 2913 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:24,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 2913 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1847 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 07:23:24,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2023-12-25 07:23:24,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1283. [2023-12-25 07:23:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1006 states have (on average 1.3011928429423458) internal successors, (1309), 1024 states have internal predecessors, (1309), 180 states have call successors, (180), 97 states have call predecessors, (180), 96 states have return successors, (179), 168 states have call predecessors, (179), 179 states have call successors, (179) [2023-12-25 07:23:24,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1668 transitions. [2023-12-25 07:23:24,802 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1668 transitions. Word has length 294 [2023-12-25 07:23:24,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:24,802 INFO L495 AbstractCegarLoop]: Abstraction has 1283 states and 1668 transitions. [2023-12-25 07:23:24,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.473684210526315) internal successors, (161), 16 states have internal predecessors, (161), 5 states have call successors, (35), 6 states have call predecessors, (35), 12 states have return successors, (35), 7 states have call predecessors, (35), 5 states have call successors, (35) [2023-12-25 07:23:24,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1668 transitions. [2023-12-25 07:23:24,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2023-12-25 07:23:24,804 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:24,805 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:24,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-12-25 07:23:25,009 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:23:25,009 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:25,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:25,009 INFO L85 PathProgramCache]: Analyzing trace with hash 332921687, now seen corresponding path program 1 times [2023-12-25 07:23:25,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:25,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851899612] [2023-12-25 07:23:25,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:25,010 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:23:25,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:25,011 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:23:25,037 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:23:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:25,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:23:25,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:25,228 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2023-12-25 07:23:25,228 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:25,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:25,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851899612] [2023-12-25 07:23:25,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [851899612] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:25,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:25,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 07:23:25,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446747870] [2023-12-25 07:23:25,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:25,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 07:23:25,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:25,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 07:23:25,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:23:25,230 INFO L87 Difference]: Start difference. First operand 1283 states and 1668 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-25 07:23:25,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:25,418 INFO L93 Difference]: Finished difference Result 2789 states and 3905 transitions. [2023-12-25 07:23:25,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 07:23:25,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 303 [2023-12-25 07:23:25,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:25,426 INFO L225 Difference]: With dead ends: 2789 [2023-12-25 07:23:25,426 INFO L226 Difference]: Without dead ends: 1876 [2023-12-25 07:23:25,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 298 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:23:25,428 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 124 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:25,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1763 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:23:25,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2023-12-25 07:23:25,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1374. [2023-12-25 07:23:25,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1079 states have (on average 1.3123262279888785) internal successors, (1416), 1097 states have internal predecessors, (1416), 198 states have call successors, (198), 97 states have call predecessors, (198), 96 states have return successors, (197), 186 states have call predecessors, (197), 197 states have call successors, (197) [2023-12-25 07:23:25,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1811 transitions. [2023-12-25 07:23:25,533 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1811 transitions. Word has length 303 [2023-12-25 07:23:25,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:25,533 INFO L495 AbstractCegarLoop]: Abstraction has 1374 states and 1811 transitions. [2023-12-25 07:23:25,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-25 07:23:25,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1811 transitions. [2023-12-25 07:23:25,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2023-12-25 07:23:25,535 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:25,535 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:25,539 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 (33)] Ended with exit code 0 [2023-12-25 07:23:25,739 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:23:25,739 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:25,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:25,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1497493293, now seen corresponding path program 1 times [2023-12-25 07:23:25,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:25,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090140942] [2023-12-25 07:23:25,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:25,740 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:23:25,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:25,742 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:23:25,767 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:23:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:25,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 07:23:25,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:26,360 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 27 proven. 174 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2023-12-25 07:23:26,360 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:23:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2023-12-25 07:23:26,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:26,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090140942] [2023-12-25 07:23:26,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090140942] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:23:26,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:23:26,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-12-25 07:23:26,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122451126] [2023-12-25 07:23:26,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:23:26,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 07:23:26,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:26,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 07:23:26,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2023-12-25 07:23:26,558 INFO L87 Difference]: Start difference. First operand 1374 states and 1811 transitions. Second operand has 19 states, 19 states have (on average 10.894736842105264) internal successors, (207), 17 states have internal predecessors, (207), 7 states have call successors, (41), 5 states have call predecessors, (41), 7 states have return successors, (40), 9 states have call predecessors, (40), 7 states have call successors, (40) [2023-12-25 07:23:28,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:28,484 INFO L93 Difference]: Finished difference Result 4923 states and 7066 transitions. [2023-12-25 07:23:28,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-25 07:23:28,485 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.894736842105264) internal successors, (207), 17 states have internal predecessors, (207), 7 states have call successors, (41), 5 states have call predecessors, (41), 7 states have return successors, (40), 9 states have call predecessors, (40), 7 states have call successors, (40) Word has length 303 [2023-12-25 07:23:28,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:28,500 INFO L225 Difference]: With dead ends: 4923 [2023-12-25 07:23:28,501 INFO L226 Difference]: Without dead ends: 3912 [2023-12-25 07:23:28,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 593 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=286, Invalid=1606, Unknown=0, NotChecked=0, Total=1892 [2023-12-25 07:23:28,504 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 1122 mSDsluCounter, 4458 mSDsCounter, 0 mSdLazyCounter, 2026 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 4824 SdHoareTripleChecker+Invalid, 2427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 2026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:28,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 4824 Invalid, 2427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 2026 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-25 07:23:28,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3912 states. [2023-12-25 07:23:28,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3912 to 2347. [2023-12-25 07:23:28,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2347 states, 1824 states have (on average 1.3152412280701755) internal successors, (2399), 1855 states have internal predecessors, (2399), 349 states have call successors, (349), 169 states have call predecessors, (349), 173 states have return successors, (408), 329 states have call predecessors, (408), 348 states have call successors, (408) [2023-12-25 07:23:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3156 transitions. [2023-12-25 07:23:28,705 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3156 transitions. Word has length 303 [2023-12-25 07:23:28,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:28,706 INFO L495 AbstractCegarLoop]: Abstraction has 2347 states and 3156 transitions. [2023-12-25 07:23:28,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.894736842105264) internal successors, (207), 17 states have internal predecessors, (207), 7 states have call successors, (41), 5 states have call predecessors, (41), 7 states have return successors, (40), 9 states have call predecessors, (40), 7 states have call successors, (40) [2023-12-25 07:23:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3156 transitions. [2023-12-25 07:23:28,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2023-12-25 07:23:28,707 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:28,707 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:28,712 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 (34)] Ended with exit code 0 [2023-12-25 07:23:28,912 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:23:28,912 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:28,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:28,912 INFO L85 PathProgramCache]: Analyzing trace with hash -610438445, now seen corresponding path program 1 times [2023-12-25 07:23:28,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:28,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821084130] [2023-12-25 07:23:28,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:28,913 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:23:28,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:28,914 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:23:28,940 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:23:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:29,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 07:23:29,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:29,558 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 40 proven. 159 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2023-12-25 07:23:29,558 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:23:29,785 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2023-12-25 07:23:29,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:29,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821084130] [2023-12-25 07:23:29,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821084130] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:23:29,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:23:29,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-12-25 07:23:29,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613473775] [2023-12-25 07:23:29,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:23:29,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 07:23:29,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:29,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 07:23:29,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2023-12-25 07:23:29,789 INFO L87 Difference]: Start difference. First operand 2347 states and 3156 transitions. Second operand has 19 states, 19 states have (on average 10.68421052631579) internal successors, (203), 17 states have internal predecessors, (203), 7 states have call successors, (41), 5 states have call predecessors, (41), 7 states have return successors, (40), 9 states have call predecessors, (40), 7 states have call successors, (40) [2023-12-25 07:23:32,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:32,560 INFO L93 Difference]: Finished difference Result 8952 states and 12895 transitions. [2023-12-25 07:23:32,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-25 07:23:32,561 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.68421052631579) internal successors, (203), 17 states have internal predecessors, (203), 7 states have call successors, (41), 5 states have call predecessors, (41), 7 states have return successors, (40), 9 states have call predecessors, (40), 7 states have call successors, (40) Word has length 303 [2023-12-25 07:23:32,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:32,592 INFO L225 Difference]: With dead ends: 8952 [2023-12-25 07:23:32,592 INFO L226 Difference]: Without dead ends: 6977 [2023-12-25 07:23:32,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=413, Invalid=2343, Unknown=0, NotChecked=0, Total=2756 [2023-12-25 07:23:32,600 INFO L413 NwaCegarLoop]: 470 mSDtfsCounter, 1525 mSDsluCounter, 5444 mSDsCounter, 0 mSdLazyCounter, 3053 mSolverCounterSat, 574 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 5914 SdHoareTripleChecker+Invalid, 3627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 574 IncrementalHoareTripleChecker+Valid, 3053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:32,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 5914 Invalid, 3627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [574 Valid, 3053 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-25 07:23:32,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6977 states. [2023-12-25 07:23:32,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6977 to 4206. [2023-12-25 07:23:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4206 states, 3233 states have (on average 1.3201360965047944) internal successors, (4268), 3292 states have internal predecessors, (4268), 670 states have call successors, (670), 286 states have call predecessors, (670), 302 states have return successors, (873), 634 states have call predecessors, (873), 669 states have call successors, (873) [2023-12-25 07:23:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4206 states to 4206 states and 5811 transitions. [2023-12-25 07:23:32,964 INFO L78 Accepts]: Start accepts. Automaton has 4206 states and 5811 transitions. Word has length 303 [2023-12-25 07:23:32,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:32,965 INFO L495 AbstractCegarLoop]: Abstraction has 4206 states and 5811 transitions. [2023-12-25 07:23:32,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.68421052631579) internal successors, (203), 17 states have internal predecessors, (203), 7 states have call successors, (41), 5 states have call predecessors, (41), 7 states have return successors, (40), 9 states have call predecessors, (40), 7 states have call successors, (40) [2023-12-25 07:23:32,965 INFO L276 IsEmpty]: Start isEmpty. Operand 4206 states and 5811 transitions. [2023-12-25 07:23:32,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2023-12-25 07:23:32,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:32,966 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:32,982 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:23:33,170 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:23:33,171 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:33,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:33,172 INFO L85 PathProgramCache]: Analyzing trace with hash 945994674, now seen corresponding path program 1 times [2023-12-25 07:23:33,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:33,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607506576] [2023-12-25 07:23:33,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:33,172 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:23:33,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:33,173 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:23:33,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-12-25 07:23:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:33,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:23:33,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:33,340 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2023-12-25 07:23:33,341 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:33,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:33,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607506576] [2023-12-25 07:23:33,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607506576] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:33,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:33,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:23:33,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022344903] [2023-12-25 07:23:33,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:33,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:23:33,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:33,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:23:33,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:23:33,342 INFO L87 Difference]: Start difference. First operand 4206 states and 5811 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 07:23:33,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:33,658 INFO L93 Difference]: Finished difference Result 8212 states and 11375 transitions. [2023-12-25 07:23:33,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:23:33,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 304 [2023-12-25 07:23:33,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:33,678 INFO L225 Difference]: With dead ends: 8212 [2023-12-25 07:23:33,679 INFO L226 Difference]: Without dead ends: 4135 [2023-12-25 07:23:33,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 302 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:23:33,686 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 8 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:33,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 668 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:33,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4135 states. [2023-12-25 07:23:34,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4135 to 4135. [2023-12-25 07:23:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4135 states, 3181 states have (on average 1.300534423137378) internal successors, (4137), 3250 states have internal predecessors, (4137), 643 states have call successors, (643), 311 states have call predecessors, (643), 310 states have return successors, (642), 580 states have call predecessors, (642), 642 states have call successors, (642) [2023-12-25 07:23:34,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4135 states to 4135 states and 5422 transitions. [2023-12-25 07:23:34,056 INFO L78 Accepts]: Start accepts. Automaton has 4135 states and 5422 transitions. Word has length 304 [2023-12-25 07:23:34,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:34,056 INFO L495 AbstractCegarLoop]: Abstraction has 4135 states and 5422 transitions. [2023-12-25 07:23:34,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 07:23:34,057 INFO L276 IsEmpty]: Start isEmpty. Operand 4135 states and 5422 transitions. [2023-12-25 07:23:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2023-12-25 07:23:34,058 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:34,058 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 8, 8, 8, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:34,074 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:23:34,263 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:23:34,263 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:34,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:34,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1665916148, now seen corresponding path program 1 times [2023-12-25 07:23:34,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:34,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445366790] [2023-12-25 07:23:34,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:34,265 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:23:34,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:34,266 INFO L229 MonitoredProcess]: Starting monitored process 37 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:23:34,268 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 (37)] Waiting until timeout for monitored process [2023-12-25 07:23:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:34,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:23:34,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 847 trivial. 0 not checked. [2023-12-25 07:23:34,473 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:34,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:34,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445366790] [2023-12-25 07:23:34,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445366790] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:34,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:34,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 07:23:34,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877088207] [2023-12-25 07:23:34,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:34,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 07:23:34,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:34,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 07:23:34,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:23:34,475 INFO L87 Difference]: Start difference. First operand 4135 states and 5422 transitions. Second operand has 6 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-25 07:23:34,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:34,951 INFO L93 Difference]: Finished difference Result 6505 states and 9215 transitions. [2023-12-25 07:23:34,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 07:23:34,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 321 [2023-12-25 07:23:34,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:34,967 INFO L225 Difference]: With dead ends: 6505 [2023-12-25 07:23:34,967 INFO L226 Difference]: Without dead ends: 6503 [2023-12-25 07:23:34,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-25 07:23:34,970 INFO L413 NwaCegarLoop]: 363 mSDtfsCounter, 162 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:34,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1662 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:34,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6503 states. [2023-12-25 07:23:35,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6503 to 4285. [2023-12-25 07:23:35,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4285 states, 3281 states have (on average 1.291374580920451) internal successors, (4237), 3375 states have internal predecessors, (4237), 668 states have call successors, (668), 336 states have call predecessors, (668), 335 states have return successors, (667), 580 states have call predecessors, (667), 667 states have call successors, (667) [2023-12-25 07:23:35,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4285 states to 4285 states and 5572 transitions. [2023-12-25 07:23:35,338 INFO L78 Accepts]: Start accepts. Automaton has 4285 states and 5572 transitions. Word has length 321 [2023-12-25 07:23:35,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:35,339 INFO L495 AbstractCegarLoop]: Abstraction has 4285 states and 5572 transitions. [2023-12-25 07:23:35,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-25 07:23:35,339 INFO L276 IsEmpty]: Start isEmpty. Operand 4285 states and 5572 transitions. [2023-12-25 07:23:35,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2023-12-25 07:23:35,341 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:35,341 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 8, 8, 8, 8, 7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:23:35,345 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 (37)] Forceful destruction successful, exit code 0 [2023-12-25 07:23:35,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:23:35,545 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:35,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:35,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1486321348, now seen corresponding path program 1 times [2023-12-25 07:23:35,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:35,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497109665] [2023-12-25 07:23:35,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:35,547 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:23:35,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:35,548 INFO L229 MonitoredProcess]: Starting monitored process 38 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:23:35,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-12-25 07:23:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:35,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 07:23:35,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 382 proven. 77 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2023-12-25 07:23:35,961 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:23:36,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:36,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497109665] [2023-12-25 07:23:36,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497109665] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 07:23:36,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1159742931] [2023-12-25 07:23:36,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:36,235 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 07:23:36,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 07:23:36,276 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 07:23:36,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-12-25 07:23:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:36,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 07:23:36,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 382 proven. 77 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2023-12-25 07:23:36,704 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:23:36,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1159742931] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 07:23:36,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:23:36,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2023-12-25 07:23:36,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817492585] [2023-12-25 07:23:36,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:23:36,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 07:23:36,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:36,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 07:23:36,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2023-12-25 07:23:36,845 INFO L87 Difference]: Start difference. First operand 4285 states and 5572 transitions. Second operand has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 9 states have internal predecessors, (146), 5 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (24), 6 states have call predecessors, (24), 5 states have call successors, (24) [2023-12-25 07:23:37,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:37,471 INFO L93 Difference]: Finished difference Result 8410 states and 11002 transitions. [2023-12-25 07:23:37,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 07:23:37,472 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 9 states have internal predecessors, (146), 5 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (24), 6 states have call predecessors, (24), 5 states have call successors, (24) Word has length 329 [2023-12-25 07:23:37,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:37,484 INFO L225 Difference]: With dead ends: 8410 [2023-12-25 07:23:37,484 INFO L226 Difference]: Without dead ends: 4502 [2023-12-25 07:23:37,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1015 GetRequests, 992 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2023-12-25 07:23:37,495 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 195 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:37,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 2244 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:23:37,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4502 states. [2023-12-25 07:23:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4502 to 4294. [2023-12-25 07:23:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4294 states, 3288 states have (on average 1.2907542579075426) internal successors, (4244), 3382 states have internal predecessors, (4244), 668 states have call successors, (668), 337 states have call predecessors, (668), 337 states have return successors, (668), 581 states have call predecessors, (668), 667 states have call successors, (668) [2023-12-25 07:23:37,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4294 states to 4294 states and 5580 transitions. [2023-12-25 07:23:37,865 INFO L78 Accepts]: Start accepts. Automaton has 4294 states and 5580 transitions. Word has length 329 [2023-12-25 07:23:37,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:37,865 INFO L495 AbstractCegarLoop]: Abstraction has 4294 states and 5580 transitions. [2023-12-25 07:23:37,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 9 states have internal predecessors, (146), 5 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (24), 6 states have call predecessors, (24), 5 states have call successors, (24) [2023-12-25 07:23:37,866 INFO L276 IsEmpty]: Start isEmpty. Operand 4294 states and 5580 transitions. [2023-12-25 07:23:37,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2023-12-25 07:23:37,867 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:37,868 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 8, 8, 8, 8, 7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:23:37,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 (38)] Forceful destruction successful, exit code 0 [2023-12-25 07:23:38,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2023-12-25 07:23:38,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 07:23:38,277 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:38,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:38,277 INFO L85 PathProgramCache]: Analyzing trace with hash -524707331, now seen corresponding path program 1 times [2023-12-25 07:23:38,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:38,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873624448] [2023-12-25 07:23:38,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:38,278 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:23:38,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:38,280 INFO L229 MonitoredProcess]: Starting monitored process 40 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:23:38,306 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 (40)] Waiting until timeout for monitored process [2023-12-25 07:23:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:38,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:23:38,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:38,467 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2023-12-25 07:23:38,468 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:38,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:38,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873624448] [2023-12-25 07:23:38,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873624448] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:38,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:38,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:23:38,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963738059] [2023-12-25 07:23:38,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:38,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:23:38,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:38,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:23:38,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:23:38,471 INFO L87 Difference]: Start difference. First operand 4294 states and 5580 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-25 07:23:38,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:38,831 INFO L93 Difference]: Finished difference Result 8265 states and 10805 transitions. [2023-12-25 07:23:38,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:23:38,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 329 [2023-12-25 07:23:38,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:38,844 INFO L225 Difference]: With dead ends: 8265 [2023-12-25 07:23:38,844 INFO L226 Difference]: Without dead ends: 4278 [2023-12-25 07:23:38,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 327 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:23:38,854 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 10 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:38,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 665 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:38,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4278 states. [2023-12-25 07:23:39,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4278 to 4278. [2023-12-25 07:23:39,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4278 states, 3277 states have (on average 1.2749465974977112) internal successors, (4178), 3371 states have internal predecessors, (4178), 664 states have call successors, (664), 337 states have call predecessors, (664), 336 states have return successors, (663), 576 states have call predecessors, (663), 663 states have call successors, (663) [2023-12-25 07:23:39,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4278 states to 4278 states and 5505 transitions. [2023-12-25 07:23:39,190 INFO L78 Accepts]: Start accepts. Automaton has 4278 states and 5505 transitions. Word has length 329 [2023-12-25 07:23:39,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:39,191 INFO L495 AbstractCegarLoop]: Abstraction has 4278 states and 5505 transitions. [2023-12-25 07:23:39,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-25 07:23:39,191 INFO L276 IsEmpty]: Start isEmpty. Operand 4278 states and 5505 transitions. [2023-12-25 07:23:39,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2023-12-25 07:23:39,193 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:39,193 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 10, 9, 8, 6, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:39,198 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 (40)] Forceful destruction successful, exit code 0 [2023-12-25 07:23:39,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:23:39,398 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:39,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:39,399 INFO L85 PathProgramCache]: Analyzing trace with hash -186769153, now seen corresponding path program 1 times [2023-12-25 07:23:39,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:39,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056309218] [2023-12-25 07:23:39,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:39,400 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:23:39,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:39,401 INFO L229 MonitoredProcess]: Starting monitored process 41 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:23:39,402 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 (41)] Waiting until timeout for monitored process [2023-12-25 07:23:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:39,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 07:23:39,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 982 backedges. 343 proven. 4 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2023-12-25 07:23:40,115 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:23:40,309 INFO L134 CoverageAnalysis]: Checked inductivity of 982 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 962 trivial. 0 not checked. [2023-12-25 07:23:40,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:40,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056309218] [2023-12-25 07:23:40,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056309218] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:23:40,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:23:40,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-12-25 07:23:40,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980379445] [2023-12-25 07:23:40,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:23:40,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 07:23:40,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:40,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 07:23:40,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2023-12-25 07:23:40,312 INFO L87 Difference]: Start difference. First operand 4278 states and 5505 transitions. Second operand has 19 states, 19 states have (on average 12.052631578947368) internal successors, (229), 17 states have internal predecessors, (229), 7 states have call successors, (51), 5 states have call predecessors, (51), 7 states have return successors, (50), 9 states have call predecessors, (50), 7 states have call successors, (50) [2023-12-25 07:23:41,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:41,628 INFO L93 Difference]: Finished difference Result 9437 states and 12181 transitions. [2023-12-25 07:23:41,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 07:23:41,628 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.052631578947368) internal successors, (229), 17 states have internal predecessors, (229), 7 states have call successors, (51), 5 states have call predecessors, (51), 7 states have return successors, (50), 9 states have call predecessors, (50), 7 states have call successors, (50) Word has length 344 [2023-12-25 07:23:41,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:41,642 INFO L225 Difference]: With dead ends: 9437 [2023-12-25 07:23:41,642 INFO L226 Difference]: Without dead ends: 5568 [2023-12-25 07:23:41,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 701 GetRequests, 670 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 07:23:41,650 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 694 mSDsluCounter, 2936 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 1811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:41,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 3249 Invalid, 1811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 07:23:41,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5568 states. [2023-12-25 07:23:42,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5568 to 5094. [2023-12-25 07:23:42,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5094 states, 3908 states have (on average 1.2722620266120779) internal successors, (4972), 4009 states have internal predecessors, (4972), 783 states have call successors, (783), 403 states have call predecessors, (783), 402 states have return successors, (782), 681 states have call predecessors, (782), 782 states have call successors, (782) [2023-12-25 07:23:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5094 states to 5094 states and 6537 transitions. [2023-12-25 07:23:42,125 INFO L78 Accepts]: Start accepts. Automaton has 5094 states and 6537 transitions. Word has length 344 [2023-12-25 07:23:42,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:42,126 INFO L495 AbstractCegarLoop]: Abstraction has 5094 states and 6537 transitions. [2023-12-25 07:23:42,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.052631578947368) internal successors, (229), 17 states have internal predecessors, (229), 7 states have call successors, (51), 5 states have call predecessors, (51), 7 states have return successors, (50), 9 states have call predecessors, (50), 7 states have call successors, (50) [2023-12-25 07:23:42,126 INFO L276 IsEmpty]: Start isEmpty. Operand 5094 states and 6537 transitions. [2023-12-25 07:23:42,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2023-12-25 07:23:42,128 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:42,128 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 8, 8, 8, 7, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:42,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 (41)] Forceful destruction successful, exit code 0 [2023-12-25 07:23:42,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:23:42,333 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:42,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:42,334 INFO L85 PathProgramCache]: Analyzing trace with hash -410492543, now seen corresponding path program 1 times [2023-12-25 07:23:42,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:42,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309987184] [2023-12-25 07:23:42,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:42,334 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:23:42,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:42,336 INFO L229 MonitoredProcess]: Starting monitored process 42 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:23:42,362 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 (42)] Waiting until timeout for monitored process [2023-12-25 07:23:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:42,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 07:23:42,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:43,030 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 217 proven. 64 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2023-12-25 07:23:43,031 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:23:43,237 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2023-12-25 07:23:43,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:43,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309987184] [2023-12-25 07:23:43,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309987184] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:23:43,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:23:43,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-25 07:23:43,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761336016] [2023-12-25 07:23:43,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:23:43,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 07:23:43,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:43,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 07:23:43,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-25 07:23:43,239 INFO L87 Difference]: Start difference. First operand 5094 states and 6537 transitions. Second operand has 14 states, 14 states have (on average 18.214285714285715) internal successors, (255), 14 states have internal predecessors, (255), 12 states have call successors, (53), 6 states have call predecessors, (53), 5 states have return successors, (52), 11 states have call predecessors, (52), 11 states have call successors, (52) [2023-12-25 07:23:47,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:47,238 INFO L93 Difference]: Finished difference Result 31214 states and 40115 transitions. [2023-12-25 07:23:47,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-12-25 07:23:47,239 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.214285714285715) internal successors, (255), 14 states have internal predecessors, (255), 12 states have call successors, (53), 6 states have call predecessors, (53), 5 states have return successors, (52), 11 states have call predecessors, (52), 11 states have call successors, (52) Word has length 356 [2023-12-25 07:23:47,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:47,316 INFO L225 Difference]: With dead ends: 31214 [2023-12-25 07:23:47,316 INFO L226 Difference]: Without dead ends: 26630 [2023-12-25 07:23:47,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 789 GetRequests, 729 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=844, Invalid=2938, Unknown=0, NotChecked=0, Total=3782 [2023-12-25 07:23:47,335 INFO L413 NwaCegarLoop]: 546 mSDtfsCounter, 1993 mSDsluCounter, 2172 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1993 SdHoareTripleChecker+Valid, 2718 SdHoareTripleChecker+Invalid, 1960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:47,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1993 Valid, 2718 Invalid, 1960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-25 07:23:47,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26630 states. [2023-12-25 07:23:48,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26630 to 6012. [2023-12-25 07:23:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6012 states, 4627 states have (on average 1.269721201642533) internal successors, (5875), 4787 states have internal predecessors, (5875), 900 states have call successors, (900), 485 states have call predecessors, (900), 484 states have return successors, (899), 739 states have call predecessors, (899), 899 states have call successors, (899) [2023-12-25 07:23:48,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 7674 transitions. [2023-12-25 07:23:48,215 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 7674 transitions. Word has length 356 [2023-12-25 07:23:48,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:48,216 INFO L495 AbstractCegarLoop]: Abstraction has 6012 states and 7674 transitions. [2023-12-25 07:23:48,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.214285714285715) internal successors, (255), 14 states have internal predecessors, (255), 12 states have call successors, (53), 6 states have call predecessors, (53), 5 states have return successors, (52), 11 states have call predecessors, (52), 11 states have call successors, (52) [2023-12-25 07:23:48,216 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 7674 transitions. [2023-12-25 07:23:48,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2023-12-25 07:23:48,219 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:48,219 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 8, 8, 8, 7, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:48,228 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 (42)] Forceful destruction successful, exit code 0 [2023-12-25 07:23:48,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:23:48,424 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:48,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:48,424 INFO L85 PathProgramCache]: Analyzing trace with hash 495318400, now seen corresponding path program 1 times [2023-12-25 07:23:48,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:48,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400590974] [2023-12-25 07:23:48,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:48,425 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:23:48,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:48,427 INFO L229 MonitoredProcess]: Starting monitored process 43 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:23:48,428 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 (43)] Waiting until timeout for monitored process [2023-12-25 07:23:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:48,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 07:23:48,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 2 proven. 271 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2023-12-25 07:23:49,238 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:23:49,425 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2023-12-25 07:23:49,425 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:49,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400590974] [2023-12-25 07:23:49,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [400590974] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:23:49,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:23:49,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-25 07:23:49,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346432409] [2023-12-25 07:23:49,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:23:49,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 07:23:49,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:49,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 07:23:49,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-25 07:23:49,427 INFO L87 Difference]: Start difference. First operand 6012 states and 7674 transitions. Second operand has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 states have internal predecessors, (254), 7 states have call successors, (53), 5 states have call predecessors, (53), 4 states have return successors, (52), 6 states have call predecessors, (52), 6 states have call successors, (52) [2023-12-25 07:23:51,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:51,407 INFO L93 Difference]: Finished difference Result 16007 states and 20423 transitions. [2023-12-25 07:23:51,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 07:23:51,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 states have internal predecessors, (254), 7 states have call successors, (53), 5 states have call predecessors, (53), 4 states have return successors, (52), 6 states have call predecessors, (52), 6 states have call successors, (52) Word has length 357 [2023-12-25 07:23:51,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:51,432 INFO L225 Difference]: With dead ends: 16007 [2023-12-25 07:23:51,432 INFO L226 Difference]: Without dead ends: 10808 [2023-12-25 07:23:51,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 712 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2023-12-25 07:23:51,439 INFO L413 NwaCegarLoop]: 643 mSDtfsCounter, 1229 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 2008 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:51,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 2008 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 07:23:51,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10808 states. [2023-12-25 07:23:52,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10808 to 8008. [2023-12-25 07:23:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8008 states, 6141 states have (on average 1.267220322423058) internal successors, (7782), 6341 states have internal predecessors, (7782), 1224 states have call successors, (1224), 643 states have call predecessors, (1224), 642 states have return successors, (1223), 1023 states have call predecessors, (1223), 1223 states have call successors, (1223) [2023-12-25 07:23:52,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8008 states to 8008 states and 10229 transitions. [2023-12-25 07:23:52,405 INFO L78 Accepts]: Start accepts. Automaton has 8008 states and 10229 transitions. Word has length 357 [2023-12-25 07:23:52,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:52,406 INFO L495 AbstractCegarLoop]: Abstraction has 8008 states and 10229 transitions. [2023-12-25 07:23:52,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 states have internal predecessors, (254), 7 states have call successors, (53), 5 states have call predecessors, (53), 4 states have return successors, (52), 6 states have call predecessors, (52), 6 states have call successors, (52) [2023-12-25 07:23:52,406 INFO L276 IsEmpty]: Start isEmpty. Operand 8008 states and 10229 transitions. [2023-12-25 07:23:52,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2023-12-25 07:23:52,409 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:52,416 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 8, 8, 8, 7, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:52,420 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 (43)] Forceful destruction successful, exit code 0 [2023-12-25 07:23:52,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:23:52,620 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:52,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:52,620 INFO L85 PathProgramCache]: Analyzing trace with hash -557226890, now seen corresponding path program 1 times [2023-12-25 07:23:52,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:52,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114581056] [2023-12-25 07:23:52,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:52,621 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:23:52,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:52,622 INFO L229 MonitoredProcess]: Starting monitored process 44 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:23:52,649 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 (44)] Waiting until timeout for monitored process [2023-12-25 07:23:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:52,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 07:23:52,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:53,408 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 2 proven. 271 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2023-12-25 07:23:53,409 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:23:53,586 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2023-12-25 07:23:53,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:53,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114581056] [2023-12-25 07:23:53,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114581056] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:23:53,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:23:53,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-25 07:23:53,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303137329] [2023-12-25 07:23:53,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:23:53,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 07:23:53,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:53,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 07:23:53,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-25 07:23:53,588 INFO L87 Difference]: Start difference. First operand 8008 states and 10229 transitions. Second operand has 9 states, 9 states have (on average 28.333333333333332) internal successors, (255), 9 states have internal predecessors, (255), 7 states have call successors, (53), 5 states have call predecessors, (53), 4 states have return successors, (52), 6 states have call predecessors, (52), 6 states have call successors, (52) [2023-12-25 07:23:56,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:56,509 INFO L93 Difference]: Finished difference Result 23646 states and 30006 transitions. [2023-12-25 07:23:56,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 07:23:56,510 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.333333333333332) internal successors, (255), 9 states have internal predecessors, (255), 7 states have call successors, (53), 5 states have call predecessors, (53), 4 states have return successors, (52), 6 states have call predecessors, (52), 6 states have call successors, (52) Word has length 358 [2023-12-25 07:23:56,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:56,548 INFO L225 Difference]: With dead ends: 23646 [2023-12-25 07:23:56,548 INFO L226 Difference]: Without dead ends: 16514 [2023-12-25 07:23:56,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 737 GetRequests, 714 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2023-12-25 07:23:56,559 INFO L413 NwaCegarLoop]: 559 mSDtfsCounter, 1844 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 631 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1844 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 631 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:56,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1844 Valid, 1639 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [631 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 07:23:56,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16514 states. [2023-12-25 07:23:58,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16514 to 9975. [2023-12-25 07:23:58,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9975 states, 7603 states have (on average 1.258450611600684) internal successors, (9568), 7844 states have internal predecessors, (9568), 1560 states have call successors, (1560), 812 states have call predecessors, (1560), 811 states have return successors, (1559), 1318 states have call predecessors, (1559), 1559 states have call successors, (1559) [2023-12-25 07:23:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9975 states to 9975 states and 12687 transitions. [2023-12-25 07:23:58,039 INFO L78 Accepts]: Start accepts. Automaton has 9975 states and 12687 transitions. Word has length 358 [2023-12-25 07:23:58,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:23:58,039 INFO L495 AbstractCegarLoop]: Abstraction has 9975 states and 12687 transitions. [2023-12-25 07:23:58,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.333333333333332) internal successors, (255), 9 states have internal predecessors, (255), 7 states have call successors, (53), 5 states have call predecessors, (53), 4 states have return successors, (52), 6 states have call predecessors, (52), 6 states have call successors, (52) [2023-12-25 07:23:58,042 INFO L276 IsEmpty]: Start isEmpty. Operand 9975 states and 12687 transitions. [2023-12-25 07:23:58,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2023-12-25 07:23:58,046 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:23:58,046 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 8, 8, 8, 7, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:58,050 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 (44)] Forceful destruction successful, exit code 0 [2023-12-25 07:23:58,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:23:58,250 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:23:58,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:23:58,251 INFO L85 PathProgramCache]: Analyzing trace with hash -124906918, now seen corresponding path program 1 times [2023-12-25 07:23:58,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:23:58,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800600195] [2023-12-25 07:23:58,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:23:58,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:23:58,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:23:58,253 INFO L229 MonitoredProcess]: Starting monitored process 45 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:23:58,255 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 (45)] Waiting until timeout for monitored process [2023-12-25 07:23:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:23:58,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:23:58,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:23:58,439 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2023-12-25 07:23:58,439 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:23:58,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:23:58,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800600195] [2023-12-25 07:23:58,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800600195] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:23:58,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:23:58,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:23:58,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967914201] [2023-12-25 07:23:58,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:23:58,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:23:58,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:23:58,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:23:58,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:23:58,441 INFO L87 Difference]: Start difference. First operand 9975 states and 12687 transitions. Second operand has 5 states, 4 states have (on average 33.25) internal successors, (133), 5 states have internal predecessors, (133), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 3 states have call successors, (24) [2023-12-25 07:23:59,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:23:59,536 INFO L93 Difference]: Finished difference Result 17362 states and 22157 transitions. [2023-12-25 07:23:59,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:23:59,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 33.25) internal successors, (133), 5 states have internal predecessors, (133), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 3 states have call successors, (24) Word has length 358 [2023-12-25 07:23:59,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:23:59,560 INFO L225 Difference]: With dead ends: 17362 [2023-12-25 07:23:59,561 INFO L226 Difference]: Without dead ends: 8012 [2023-12-25 07:23:59,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 354 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:23:59,577 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 2 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:23:59,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 930 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:23:59,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8012 states. [2023-12-25 07:24:00,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8012 to 7948. [2023-12-25 07:24:00,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7948 states, 6061 states have (on average 1.2473189242699225) internal successors, (7560), 6215 states have internal predecessors, (7560), 1234 states have call successors, (1234), 653 states have call predecessors, (1234), 652 states have return successors, (1233), 1079 states have call predecessors, (1233), 1233 states have call successors, (1233) [2023-12-25 07:24:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7948 states to 7948 states and 10027 transitions. [2023-12-25 07:24:00,848 INFO L78 Accepts]: Start accepts. Automaton has 7948 states and 10027 transitions. Word has length 358 [2023-12-25 07:24:00,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:24:00,849 INFO L495 AbstractCegarLoop]: Abstraction has 7948 states and 10027 transitions. [2023-12-25 07:24:00,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 33.25) internal successors, (133), 5 states have internal predecessors, (133), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 3 states have call successors, (24) [2023-12-25 07:24:00,849 INFO L276 IsEmpty]: Start isEmpty. Operand 7948 states and 10027 transitions. [2023-12-25 07:24:00,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2023-12-25 07:24:00,853 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:24:00,853 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 8, 8, 8, 7, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 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:24:00,874 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 (45)] Forceful destruction successful, exit code 0 [2023-12-25 07:24:01,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:24:01,058 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:24:01,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:24:01,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1314575944, now seen corresponding path program 1 times [2023-12-25 07:24:01,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:24:01,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394203654] [2023-12-25 07:24:01,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:24:01,059 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:24:01,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:24:01,060 INFO L229 MonitoredProcess]: Starting monitored process 46 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:24:01,064 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 (46)] Waiting until timeout for monitored process [2023-12-25 07:24:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:24:01,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 07:24:01,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:24:01,834 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 221 proven. 73 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2023-12-25 07:24:01,834 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:24:02,071 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 913 trivial. 0 not checked. [2023-12-25 07:24:02,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:24:02,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394203654] [2023-12-25 07:24:02,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394203654] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:24:02,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:24:02,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-25 07:24:02,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222918186] [2023-12-25 07:24:02,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:24:02,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 07:24:02,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:24:02,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 07:24:02,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-25 07:24:02,074 INFO L87 Difference]: Start difference. First operand 7948 states and 10027 transitions. Second operand has 14 states, 14 states have (on average 19.0) internal successors, (266), 14 states have internal predecessors, (266), 12 states have call successors, (55), 6 states have call predecessors, (55), 5 states have return successors, (54), 11 states have call predecessors, (54), 11 states have call successors, (54) [2023-12-25 07:24:11,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:24:11,823 INFO L93 Difference]: Finished difference Result 56355 states and 71905 transitions. [2023-12-25 07:24:11,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-12-25 07:24:11,823 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 19.0) internal successors, (266), 14 states have internal predecessors, (266), 12 states have call successors, (55), 6 states have call predecessors, (55), 5 states have return successors, (54), 11 states have call predecessors, (54), 11 states have call successors, (54) Word has length 364 [2023-12-25 07:24:11,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:24:11,994 INFO L225 Difference]: With dead ends: 56355 [2023-12-25 07:24:11,995 INFO L226 Difference]: Without dead ends: 49170 [2023-12-25 07:24:12,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 805 GetRequests, 745 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=844, Invalid=2938, Unknown=0, NotChecked=0, Total=3782 [2023-12-25 07:24:12,017 INFO L413 NwaCegarLoop]: 801 mSDtfsCounter, 1718 mSDsluCounter, 2618 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1718 SdHoareTripleChecker+Valid, 3419 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:24:12,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1718 Valid, 3419 Invalid, 2132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-25 07:24:12,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49170 states. [2023-12-25 07:24:13,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49170 to 8281. [2023-12-25 07:24:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8281 states, 6318 states have (on average 1.247230136119025) internal successors, (7880), 6504 states have internal predecessors, (7880), 1291 states have call successors, (1291), 672 states have call predecessors, (1291), 671 states have return successors, (1290), 1104 states have call predecessors, (1290), 1290 states have call successors, (1290) [2023-12-25 07:24:13,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8281 states to 8281 states and 10461 transitions. [2023-12-25 07:24:13,878 INFO L78 Accepts]: Start accepts. Automaton has 8281 states and 10461 transitions. Word has length 364 [2023-12-25 07:24:13,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:24:13,879 INFO L495 AbstractCegarLoop]: Abstraction has 8281 states and 10461 transitions. [2023-12-25 07:24:13,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 19.0) internal successors, (266), 14 states have internal predecessors, (266), 12 states have call successors, (55), 6 states have call predecessors, (55), 5 states have return successors, (54), 11 states have call predecessors, (54), 11 states have call successors, (54) [2023-12-25 07:24:13,879 INFO L276 IsEmpty]: Start isEmpty. Operand 8281 states and 10461 transitions. [2023-12-25 07:24:13,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2023-12-25 07:24:13,883 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:24:13,883 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 8, 8, 8, 7, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:13,890 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 (46)] Forceful destruction successful, exit code 0 [2023-12-25 07:24:14,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:24:14,088 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:24:14,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:24:14,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1927028193, now seen corresponding path program 1 times [2023-12-25 07:24:14,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:24:14,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456491568] [2023-12-25 07:24:14,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:24:14,090 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:24:14,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:24:14,091 INFO L229 MonitoredProcess]: Starting monitored process 47 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:24:14,116 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 (47)] Waiting until timeout for monitored process [2023-12-25 07:24:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:24:14,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:24:14,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:24:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 659 trivial. 0 not checked. [2023-12-25 07:24:14,278 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:24:14,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:24:14,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456491568] [2023-12-25 07:24:14,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456491568] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:24:14,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:24:14,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:24:14,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490009788] [2023-12-25 07:24:14,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:24:14,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:24:14,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:24:14,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:24:14,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:24:14,279 INFO L87 Difference]: Start difference. First operand 8281 states and 10461 transitions. Second operand has 5 states, 4 states have (on average 35.25) internal successors, (141), 5 states have internal predecessors, (141), 3 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2023-12-25 07:24:15,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:24:15,291 INFO L93 Difference]: Finished difference Result 12954 states and 16371 transitions. [2023-12-25 07:24:15,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:24:15,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 35.25) internal successors, (141), 5 states have internal predecessors, (141), 3 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) Word has length 366 [2023-12-25 07:24:15,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:24:15,302 INFO L225 Difference]: With dead ends: 12954 [2023-12-25 07:24:15,303 INFO L226 Difference]: Without dead ends: 5080 [2023-12-25 07:24:15,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 362 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:24:15,312 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 2 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:24:15,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 906 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:24:15,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5080 states. [2023-12-25 07:24:16,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5080 to 5080. [2023-12-25 07:24:16,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5080 states, 3903 states have (on average 1.2226492441711505) internal successors, (4772), 3991 states have internal predecessors, (4772), 765 states have call successors, (765), 411 states have call predecessors, (765), 411 states have return successors, (765), 677 states have call predecessors, (765), 765 states have call successors, (765) [2023-12-25 07:24:16,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5080 states to 5080 states and 6302 transitions. [2023-12-25 07:24:16,542 INFO L78 Accepts]: Start accepts. Automaton has 5080 states and 6302 transitions. Word has length 366 [2023-12-25 07:24:16,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:24:16,542 INFO L495 AbstractCegarLoop]: Abstraction has 5080 states and 6302 transitions. [2023-12-25 07:24:16,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 35.25) internal successors, (141), 5 states have internal predecessors, (141), 3 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2023-12-25 07:24:16,543 INFO L276 IsEmpty]: Start isEmpty. Operand 5080 states and 6302 transitions. [2023-12-25 07:24:16,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2023-12-25 07:24:16,549 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:24:16,549 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 10, 10, 10, 9, 8, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2023-12-25 07:24:16,555 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 (47)] Forceful destruction successful, exit code 0 [2023-12-25 07:24:16,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:24:16,754 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:24:16,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:24:16,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1806398633, now seen corresponding path program 1 times [2023-12-25 07:24:16,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:24:16,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532503901] [2023-12-25 07:24:16,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:24:16,755 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:24:16,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:24:16,756 INFO L229 MonitoredProcess]: Starting monitored process 48 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:24:16,784 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 (48)] Waiting until timeout for monitored process [2023-12-25 07:24:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:24:16,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 07:24:16,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:24:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 223 proven. 286 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2023-12-25 07:24:17,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:24:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2023-12-25 07:24:17,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:24:17,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532503901] [2023-12-25 07:24:17,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532503901] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:24:17,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:24:17,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-25 07:24:17,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273817107] [2023-12-25 07:24:17,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:24:17,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 07:24:17,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:24:17,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 07:24:17,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-12-25 07:24:17,859 INFO L87 Difference]: Start difference. First operand 5080 states and 6302 transitions. Second operand has 14 states, 14 states have (on average 20.071428571428573) internal successors, (281), 14 states have internal predecessors, (281), 12 states have call successors, (65), 6 states have call predecessors, (65), 6 states have return successors, (64), 12 states have call predecessors, (64), 12 states have call successors, (64) [2023-12-25 07:24:23,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:24:23,134 INFO L93 Difference]: Finished difference Result 16665 states and 20724 transitions. [2023-12-25 07:24:23,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-12-25 07:24:23,134 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.071428571428573) internal successors, (281), 14 states have internal predecessors, (281), 12 states have call successors, (65), 6 states have call predecessors, (65), 6 states have return successors, (64), 12 states have call predecessors, (64), 12 states have call successors, (64) Word has length 405 [2023-12-25 07:24:23,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:24:23,161 INFO L225 Difference]: With dead ends: 16665 [2023-12-25 07:24:23,161 INFO L226 Difference]: Without dead ends: 12193 [2023-12-25 07:24:23,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 902 GetRequests, 828 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1758 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1085, Invalid=4317, Unknown=0, NotChecked=0, Total=5402 [2023-12-25 07:24:23,185 INFO L413 NwaCegarLoop]: 517 mSDtfsCounter, 2364 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 727 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2364 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 727 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:24:23,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2364 Valid, 2523 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [727 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-25 07:24:23,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12193 states. [2023-12-25 07:24:24,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12193 to 6218. [2023-12-25 07:24:24,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6218 states, 4754 states have (on average 1.2147665124106015) internal successors, (5775), 4867 states have internal predecessors, (5775), 953 states have call successors, (953), 510 states have call predecessors, (953), 510 states have return successors, (953), 840 states have call predecessors, (953), 953 states have call successors, (953) [2023-12-25 07:24:24,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 7681 transitions. [2023-12-25 07:24:24,605 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 7681 transitions. Word has length 405 [2023-12-25 07:24:24,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:24:24,606 INFO L495 AbstractCegarLoop]: Abstraction has 6218 states and 7681 transitions. [2023-12-25 07:24:24,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.071428571428573) internal successors, (281), 14 states have internal predecessors, (281), 12 states have call successors, (65), 6 states have call predecessors, (65), 6 states have return successors, (64), 12 states have call predecessors, (64), 12 states have call successors, (64) [2023-12-25 07:24:24,608 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 7681 transitions. [2023-12-25 07:24:24,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2023-12-25 07:24:24,633 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:24:24,634 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 10, 10, 10, 9, 8, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1] [2023-12-25 07:24:24,654 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 (48)] Forceful destruction successful, exit code 0 [2023-12-25 07:24:24,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:24:24,839 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:24:24,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:24:24,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1795458298, now seen corresponding path program 1 times [2023-12-25 07:24:24,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:24:24,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20825944] [2023-12-25 07:24:24,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:24:24,840 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:24:24,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:24:24,842 INFO L229 MonitoredProcess]: Starting monitored process 49 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:24:24,869 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 (49)] Waiting until timeout for monitored process [2023-12-25 07:24:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:24:25,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 07:24:25,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:24:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 223 proven. 284 refuted. 0 times theorem prover too weak. 647 trivial. 0 not checked. [2023-12-25 07:24:25,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:24:26,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2023-12-25 07:24:26,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:24:26,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20825944] [2023-12-25 07:24:26,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20825944] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:24:26,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:24:26,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-25 07:24:26,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748202169] [2023-12-25 07:24:26,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:24:26,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 07:24:26,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:24:26,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 07:24:26,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-12-25 07:24:26,040 INFO L87 Difference]: Start difference. First operand 6218 states and 7681 transitions. Second operand has 14 states, 14 states have (on average 20.285714285714285) internal successors, (284), 14 states have internal predecessors, (284), 12 states have call successors, (65), 6 states have call predecessors, (65), 6 states have return successors, (64), 12 states have call predecessors, (64), 12 states have call successors, (64) [2023-12-25 07:24:31,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:24:31,710 INFO L93 Difference]: Finished difference Result 19051 states and 23619 transitions. [2023-12-25 07:24:31,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-12-25 07:24:31,710 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.285714285714285) internal successors, (284), 14 states have internal predecessors, (284), 12 states have call successors, (65), 6 states have call predecessors, (65), 6 states have return successors, (64), 12 states have call predecessors, (64), 12 states have call successors, (64) Word has length 406 [2023-12-25 07:24:31,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:24:31,742 INFO L225 Difference]: With dead ends: 19051 [2023-12-25 07:24:31,742 INFO L226 Difference]: Without dead ends: 13505 [2023-12-25 07:24:31,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 904 GetRequests, 830 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1678 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1085, Invalid=4317, Unknown=0, NotChecked=0, Total=5402 [2023-12-25 07:24:31,753 INFO L413 NwaCegarLoop]: 998 mSDtfsCounter, 1479 mSDsluCounter, 4303 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 5301 SdHoareTripleChecker+Invalid, 2557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-25 07:24:31,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1479 Valid, 5301 Invalid, 2557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 2161 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-25 07:24:31,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13505 states. [2023-12-25 07:24:33,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13505 to 7590. [2023-12-25 07:24:33,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7590 states, 5780 states have (on average 1.2131487889273356) internal successors, (7012), 5942 states have internal predecessors, (7012), 1186 states have call successors, (1186), 623 states have call predecessors, (1186), 623 states have return successors, (1186), 1024 states have call predecessors, (1186), 1186 states have call successors, (1186) [2023-12-25 07:24:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7590 states to 7590 states and 9384 transitions. [2023-12-25 07:24:33,429 INFO L78 Accepts]: Start accepts. Automaton has 7590 states and 9384 transitions. Word has length 406 [2023-12-25 07:24:33,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:24:33,429 INFO L495 AbstractCegarLoop]: Abstraction has 7590 states and 9384 transitions. [2023-12-25 07:24:33,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.285714285714285) internal successors, (284), 14 states have internal predecessors, (284), 12 states have call successors, (65), 6 states have call predecessors, (65), 6 states have return successors, (64), 12 states have call predecessors, (64), 12 states have call successors, (64) [2023-12-25 07:24:33,430 INFO L276 IsEmpty]: Start isEmpty. Operand 7590 states and 9384 transitions. [2023-12-25 07:24:33,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2023-12-25 07:24:33,439 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:24:33,439 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 10, 10, 10, 9, 8, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2023-12-25 07:24:33,444 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 (49)] Forceful destruction successful, exit code 0 [2023-12-25 07:24:33,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:24:33,644 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:24:33,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:24:33,645 INFO L85 PathProgramCache]: Analyzing trace with hash -457215840, now seen corresponding path program 1 times [2023-12-25 07:24:33,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:24:33,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152257387] [2023-12-25 07:24:33,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:24:33,646 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:24:33,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:24:33,647 INFO L229 MonitoredProcess]: Starting monitored process 50 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:24:33,663 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 (50)] Waiting until timeout for monitored process [2023-12-25 07:24:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:24:33,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 07:24:33,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:24:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 416 proven. 98 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2023-12-25 07:24:34,109 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:24:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 38 proven. 70 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2023-12-25 07:24:34,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:24:34,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152257387] [2023-12-25 07:24:34,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152257387] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:24:34,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:24:34,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2023-12-25 07:24:34,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654333898] [2023-12-25 07:24:34,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:24:34,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 07:24:34,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:24:34,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 07:24:34,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2023-12-25 07:24:34,458 INFO L87 Difference]: Start difference. First operand 7590 states and 9384 transitions. Second operand has 20 states, 20 states have (on average 10.2) internal successors, (204), 17 states have internal predecessors, (204), 4 states have call successors, (55), 8 states have call predecessors, (55), 14 states have return successors, (55), 7 states have call predecessors, (55), 4 states have call successors, (55) [2023-12-25 07:24:38,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:24:38,574 INFO L93 Difference]: Finished difference Result 17334 states and 21818 transitions. [2023-12-25 07:24:38,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-12-25 07:24:38,575 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 10.2) internal successors, (204), 17 states have internal predecessors, (204), 4 states have call successors, (55), 8 states have call predecessors, (55), 14 states have return successors, (55), 7 states have call predecessors, (55), 4 states have call successors, (55) Word has length 406 [2023-12-25 07:24:38,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:24:38,598 INFO L225 Difference]: With dead ends: 17334 [2023-12-25 07:24:38,598 INFO L226 Difference]: Without dead ends: 10377 [2023-12-25 07:24:38,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 849 GetRequests, 796 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=550, Invalid=2420, Unknown=0, NotChecked=0, Total=2970 [2023-12-25 07:24:38,608 INFO L413 NwaCegarLoop]: 396 mSDtfsCounter, 1550 mSDsluCounter, 4113 mSDsCounter, 0 mSdLazyCounter, 2974 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1550 SdHoareTripleChecker+Valid, 4509 SdHoareTripleChecker+Invalid, 3624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 2974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:24:38,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1550 Valid, 4509 Invalid, 3624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 2974 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-25 07:24:38,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10377 states. [2023-12-25 07:24:40,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10377 to 7835. [2023-12-25 07:24:40,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7835 states, 5950 states have (on average 1.2089075630252102) internal successors, (7193), 6065 states have internal predecessors, (7193), 1270 states have call successors, (1270), 614 states have call predecessors, (1270), 614 states have return successors, (1270), 1155 states have call predecessors, (1270), 1270 states have call successors, (1270) [2023-12-25 07:24:40,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7835 states to 7835 states and 9733 transitions. [2023-12-25 07:24:40,521 INFO L78 Accepts]: Start accepts. Automaton has 7835 states and 9733 transitions. Word has length 406 [2023-12-25 07:24:40,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:24:40,521 INFO L495 AbstractCegarLoop]: Abstraction has 7835 states and 9733 transitions. [2023-12-25 07:24:40,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.2) internal successors, (204), 17 states have internal predecessors, (204), 4 states have call successors, (55), 8 states have call predecessors, (55), 14 states have return successors, (55), 7 states have call predecessors, (55), 4 states have call successors, (55) [2023-12-25 07:24:40,522 INFO L276 IsEmpty]: Start isEmpty. Operand 7835 states and 9733 transitions. [2023-12-25 07:24:40,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2023-12-25 07:24:40,530 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:24:40,531 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 10, 10, 10, 9, 8, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1] [2023-12-25 07:24:40,537 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 (50)] Ended with exit code 0 [2023-12-25 07:24:40,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:24:40,737 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:24:40,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:24:40,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1653110980, now seen corresponding path program 1 times [2023-12-25 07:24:40,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:24:40,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548075244] [2023-12-25 07:24:40,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:24:40,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:24:40,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:24:40,739 INFO L229 MonitoredProcess]: Starting monitored process 51 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:24:40,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (51)] Waiting until timeout for monitored process [2023-12-25 07:24:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:24:40,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:24:40,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:24:41,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 357 proven. 149 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2023-12-25 07:24:41,636 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:24:41,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 22 proven. 23 refuted. 0 times theorem prover too weak. 1109 trivial. 0 not checked. [2023-12-25 07:24:41,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:24:41,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548075244] [2023-12-25 07:24:41,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548075244] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:24:41,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:24:41,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2023-12-25 07:24:41,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520923411] [2023-12-25 07:24:41,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:24:41,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:24:41,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:24:41,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:24:41,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:24:41,972 INFO L87 Difference]: Start difference. First operand 7835 states and 9733 transitions. Second operand has 26 states, 26 states have (on average 11.615384615384615) internal successors, (302), 24 states have internal predecessors, (302), 12 states have call successors, (65), 6 states have call predecessors, (65), 8 states have return successors, (64), 14 states have call predecessors, (64), 12 states have call successors, (64) [2023-12-25 07:25:11,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:25:11,513 INFO L93 Difference]: Finished difference Result 83187 states and 104774 transitions. [2023-12-25 07:25:11,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 287 states. [2023-12-25 07:25:11,514 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 11.615384615384615) internal successors, (302), 24 states have internal predecessors, (302), 12 states have call successors, (65), 6 states have call predecessors, (65), 8 states have return successors, (64), 14 states have call predecessors, (64), 12 states have call successors, (64) Word has length 407 [2023-12-25 07:25:11,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:25:11,921 INFO L225 Difference]: With dead ends: 83187 [2023-12-25 07:25:11,921 INFO L226 Difference]: Without dead ends: 76097 [2023-12-25 07:25:11,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1111 GetRequests, 809 SyntacticMatches, 0 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39686 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7831, Invalid=84281, Unknown=0, NotChecked=0, Total=92112 [2023-12-25 07:25:11,974 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 2185 mSDsluCounter, 9298 mSDsCounter, 0 mSdLazyCounter, 6650 mSolverCounterSat, 576 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2193 SdHoareTripleChecker+Valid, 10248 SdHoareTripleChecker+Invalid, 7226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 576 IncrementalHoareTripleChecker+Valid, 6650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-25 07:25:11,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2193 Valid, 10248 Invalid, 7226 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [576 Valid, 6650 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-12-25 07:25:12,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76097 states. [2023-12-25 07:25:15,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76097 to 8545. [2023-12-25 07:25:15,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8545 states, 6495 states have (on average 1.1896843725943034) internal successors, (7727), 6655 states have internal predecessors, (7727), 1342 states have call successors, (1342), 707 states have call predecessors, (1342), 707 states have return successors, (1342), 1182 states have call predecessors, (1342), 1342 states have call successors, (1342) [2023-12-25 07:25:15,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8545 states to 8545 states and 10411 transitions. [2023-12-25 07:25:15,630 INFO L78 Accepts]: Start accepts. Automaton has 8545 states and 10411 transitions. Word has length 407 [2023-12-25 07:25:15,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:25:15,630 INFO L495 AbstractCegarLoop]: Abstraction has 8545 states and 10411 transitions. [2023-12-25 07:25:15,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 11.615384615384615) internal successors, (302), 24 states have internal predecessors, (302), 12 states have call successors, (65), 6 states have call predecessors, (65), 8 states have return successors, (64), 14 states have call predecessors, (64), 12 states have call successors, (64) [2023-12-25 07:25:15,631 INFO L276 IsEmpty]: Start isEmpty. Operand 8545 states and 10411 transitions. [2023-12-25 07:25:15,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2023-12-25 07:25:15,643 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:25:15,643 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 10, 10, 10, 9, 8, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:25:15,650 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 (51)] Ended with exit code 0 [2023-12-25 07:25:15,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:25:15,851 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:25:15,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:25:15,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1048655905, now seen corresponding path program 1 times [2023-12-25 07:25:15,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:25:15,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344031594] [2023-12-25 07:25:15,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:25:15,852 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:25:15,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:25:15,853 INFO L229 MonitoredProcess]: Starting monitored process 52 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:25:15,873 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 (52)] Waiting until timeout for monitored process [2023-12-25 07:25:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:25:16,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:25:16,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:25:16,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1153 backedges. 357 proven. 157 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2023-12-25 07:25:16,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:25:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1153 backedges. 22 proven. 22 refuted. 0 times theorem prover too weak. 1109 trivial. 0 not checked. [2023-12-25 07:25:17,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:25:17,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344031594] [2023-12-25 07:25:17,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344031594] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:25:17,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:25:17,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2023-12-25 07:25:17,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583137859] [2023-12-25 07:25:17,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:25:17,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:25:17,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:25:17,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:25:17,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:25:17,250 INFO L87 Difference]: Start difference. First operand 8545 states and 10411 transitions. Second operand has 26 states, 26 states have (on average 11.73076923076923) internal successors, (305), 24 states have internal predecessors, (305), 14 states have call successors, (65), 7 states have call predecessors, (65), 9 states have return successors, (64), 16 states have call predecessors, (64), 14 states have call successors, (64) [2023-12-25 07:25:34,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:25:34,485 INFO L93 Difference]: Finished difference Result 37211 states and 45990 transitions. [2023-12-25 07:25:34,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2023-12-25 07:25:34,486 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 11.73076923076923) internal successors, (305), 24 states have internal predecessors, (305), 14 states have call successors, (65), 7 states have call predecessors, (65), 9 states have return successors, (64), 16 states have call predecessors, (64), 14 states have call successors, (64) Word has length 407 [2023-12-25 07:25:34,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:25:34,561 INFO L225 Difference]: With dead ends: 37211 [2023-12-25 07:25:34,561 INFO L226 Difference]: Without dead ends: 29485 [2023-12-25 07:25:34,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1054 GetRequests, 831 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19863 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4544, Invalid=45856, Unknown=0, NotChecked=0, Total=50400 [2023-12-25 07:25:34,580 INFO L413 NwaCegarLoop]: 1027 mSDtfsCounter, 2596 mSDsluCounter, 9610 mSDsCounter, 0 mSdLazyCounter, 6111 mSolverCounterSat, 712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2604 SdHoareTripleChecker+Valid, 10637 SdHoareTripleChecker+Invalid, 6823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 712 IncrementalHoareTripleChecker+Valid, 6111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:25:34,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2604 Valid, 10637 Invalid, 6823 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [712 Valid, 6111 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-25 07:25:34,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29485 states. [2023-12-25 07:25:37,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29485 to 10475. [2023-12-25 07:25:37,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10475 states, 7981 states have (on average 1.1865680992356848) internal successors, (9470), 8163 states have internal predecessors, (9470), 1636 states have call successors, (1636), 857 states have call predecessors, (1636), 857 states have return successors, (1636), 1454 states have call predecessors, (1636), 1636 states have call successors, (1636) [2023-12-25 07:25:37,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10475 states to 10475 states and 12742 transitions. [2023-12-25 07:25:37,687 INFO L78 Accepts]: Start accepts. Automaton has 10475 states and 12742 transitions. Word has length 407 [2023-12-25 07:25:37,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:25:37,687 INFO L495 AbstractCegarLoop]: Abstraction has 10475 states and 12742 transitions. [2023-12-25 07:25:37,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 11.73076923076923) internal successors, (305), 24 states have internal predecessors, (305), 14 states have call successors, (65), 7 states have call predecessors, (65), 9 states have return successors, (64), 16 states have call predecessors, (64), 14 states have call successors, (64) [2023-12-25 07:25:37,688 INFO L276 IsEmpty]: Start isEmpty. Operand 10475 states and 12742 transitions. [2023-12-25 07:25:37,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2023-12-25 07:25:37,703 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:25:37,703 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 10, 10, 10, 9, 8, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1] [2023-12-25 07:25:37,708 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 (52)] Ended with exit code 0 [2023-12-25 07:25:37,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:25:37,908 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:25:37,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:25:37,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1469713053, now seen corresponding path program 1 times [2023-12-25 07:25:37,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:25:37,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103891789] [2023-12-25 07:25:37,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:25:37,909 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:25:37,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:25:37,911 INFO L229 MonitoredProcess]: Starting monitored process 53 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:25:37,938 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 (53)] Waiting until timeout for monitored process [2023-12-25 07:25:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:25:38,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:25:38,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:25:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2023-12-25 07:25:38,129 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:25:38,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:25:38,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103891789] [2023-12-25 07:25:38,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103891789] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:25:38,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:25:38,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:25:38,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595231381] [2023-12-25 07:25:38,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:25:38,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:25:38,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:25:38,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:25:38,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:25:38,130 INFO L87 Difference]: Start difference. First operand 10475 states and 12742 transitions. Second operand has 5 states, 4 states have (on average 36.75) internal successors, (147), 5 states have internal predecessors, (147), 3 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 3 states have call successors, (29) [2023-12-25 07:25:40,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:25:40,572 INFO L93 Difference]: Finished difference Result 18204 states and 22171 transitions. [2023-12-25 07:25:40,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:25:40,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 36.75) internal successors, (147), 5 states have internal predecessors, (147), 3 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 3 states have call successors, (29) Word has length 409 [2023-12-25 07:25:40,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:25:40,590 INFO L225 Difference]: With dead ends: 18204 [2023-12-25 07:25:40,590 INFO L226 Difference]: Without dead ends: 8146 [2023-12-25 07:25:40,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 405 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:25:40,599 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 2 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:25:40,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 838 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:25:40,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8146 states. [2023-12-25 07:25:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8146 to 8146. [2023-12-25 07:25:43,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8146 states, 6239 states have (on average 1.1734252284019875) internal successors, (7321), 6360 states have internal predecessors, (7321), 1228 states have call successors, (1228), 678 states have call predecessors, (1228), 678 states have return successors, (1228), 1107 states have call predecessors, (1228), 1228 states have call successors, (1228) [2023-12-25 07:25:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8146 states to 8146 states and 9777 transitions. [2023-12-25 07:25:43,259 INFO L78 Accepts]: Start accepts. Automaton has 8146 states and 9777 transitions. Word has length 409 [2023-12-25 07:25:43,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:25:43,259 INFO L495 AbstractCegarLoop]: Abstraction has 8146 states and 9777 transitions. [2023-12-25 07:25:43,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 36.75) internal successors, (147), 5 states have internal predecessors, (147), 3 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 3 states have call successors, (29) [2023-12-25 07:25:43,260 INFO L276 IsEmpty]: Start isEmpty. Operand 8146 states and 9777 transitions. [2023-12-25 07:25:43,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2023-12-25 07:25:43,275 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:25:43,276 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 11, 9, 8, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1] [2023-12-25 07:25:43,283 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 (53)] Forceful destruction successful, exit code 0 [2023-12-25 07:25:43,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:25:43,481 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:25:43,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:25:43,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1149226889, now seen corresponding path program 1 times [2023-12-25 07:25:43,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:25:43,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068474266] [2023-12-25 07:25:43,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:25:43,482 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:25:43,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:25:43,484 INFO L229 MonitoredProcess]: Starting monitored process 54 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:25:43,485 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 (54)] Waiting until timeout for monitored process [2023-12-25 07:25:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:25:43,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 07:25:43,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:25:44,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1263 backedges. 187 proven. 401 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2023-12-25 07:25:44,063 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:25:44,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1263 backedges. 23 proven. 31 refuted. 0 times theorem prover too weak. 1209 trivial. 0 not checked. [2023-12-25 07:25:44,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:25:44,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068474266] [2023-12-25 07:25:44,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068474266] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:25:44,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:25:44,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2023-12-25 07:25:44,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485932030] [2023-12-25 07:25:44,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:25:44,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-25 07:25:44,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:25:44,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-25 07:25:44,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2023-12-25 07:25:44,318 INFO L87 Difference]: Start difference. First operand 8146 states and 9777 transitions. Second operand has 22 states, 22 states have (on average 13.681818181818182) internal successors, (301), 20 states have internal predecessors, (301), 10 states have call successors, (69), 6 states have call predecessors, (69), 8 states have return successors, (68), 12 states have call predecessors, (68), 10 states have call successors, (68) [2023-12-25 07:25:50,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:25:50,419 INFO L93 Difference]: Finished difference Result 24978 states and 30405 transitions. [2023-12-25 07:25:50,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 07:25:50,420 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 13.681818181818182) internal successors, (301), 20 states have internal predecessors, (301), 10 states have call successors, (69), 6 states have call predecessors, (69), 8 states have return successors, (68), 12 states have call predecessors, (68), 10 states have call successors, (68) Word has length 422 [2023-12-25 07:25:50,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:25:50,460 INFO L225 Difference]: With dead ends: 24978 [2023-12-25 07:25:50,461 INFO L226 Difference]: Without dead ends: 17667 [2023-12-25 07:25:50,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 826 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=1320, Unknown=0, NotChecked=0, Total=1560 [2023-12-25 07:25:50,474 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 911 mSDsluCounter, 4846 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 5216 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 07:25:50,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 5216 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 07:25:50,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17667 states. [2023-12-25 07:25:54,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17667 to 15232. [2023-12-25 07:25:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15232 states, 11648 states have (on average 1.1742788461538463) internal successors, (13678), 11886 states have internal predecessors, (13678), 2314 states have call successors, (2314), 1269 states have call predecessors, (2314), 1269 states have return successors, (2314), 2076 states have call predecessors, (2314), 2314 states have call successors, (2314) [2023-12-25 07:25:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15232 states to 15232 states and 18306 transitions. [2023-12-25 07:25:54,954 INFO L78 Accepts]: Start accepts. Automaton has 15232 states and 18306 transitions. Word has length 422 [2023-12-25 07:25:54,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:25:54,955 INFO L495 AbstractCegarLoop]: Abstraction has 15232 states and 18306 transitions. [2023-12-25 07:25:54,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 13.681818181818182) internal successors, (301), 20 states have internal predecessors, (301), 10 states have call successors, (69), 6 states have call predecessors, (69), 8 states have return successors, (68), 12 states have call predecessors, (68), 10 states have call successors, (68) [2023-12-25 07:25:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 15232 states and 18306 transitions. [2023-12-25 07:25:54,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2023-12-25 07:25:54,970 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:25:54,970 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:54,975 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 (54)] Ended with exit code 0 [2023-12-25 07:25:55,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:25:55,175 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:25:55,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:25:55,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1285166096, now seen corresponding path program 1 times [2023-12-25 07:25:55,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:25:55,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189801098] [2023-12-25 07:25:55,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:25:55,177 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:25:55,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:25:55,178 INFO L229 MonitoredProcess]: Starting monitored process 55 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:25:55,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (55)] Waiting until timeout for monitored process [2023-12-25 07:25:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:25:55,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 07:25:55,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:25:55,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 544 proven. 96 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2023-12-25 07:25:55,608 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:25:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 52 proven. 70 refuted. 0 times theorem prover too weak. 1175 trivial. 0 not checked. [2023-12-25 07:25:55,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:25:55,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189801098] [2023-12-25 07:25:55,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189801098] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:25:55,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:25:55,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2023-12-25 07:25:55,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148719036] [2023-12-25 07:25:55,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:25:55,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 07:25:55,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:25:55,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 07:25:55,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2023-12-25 07:25:55,906 INFO L87 Difference]: Start difference. First operand 15232 states and 18306 transitions. Second operand has 20 states, 20 states have (on average 10.7) internal successors, (214), 17 states have internal predecessors, (214), 4 states have call successors, (59), 8 states have call predecessors, (59), 14 states have return successors, (59), 7 states have call predecessors, (59), 4 states have call successors, (59) [2023-12-25 07:26:02,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:26:02,292 INFO L93 Difference]: Finished difference Result 25742 states and 30999 transitions. [2023-12-25 07:26:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-25 07:26:02,293 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 10.7) internal successors, (214), 17 states have internal predecessors, (214), 4 states have call successors, (59), 8 states have call predecessors, (59), 14 states have return successors, (59), 7 states have call predecessors, (59), 4 states have call successors, (59) Word has length 428 [2023-12-25 07:26:02,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:26:02,333 INFO L225 Difference]: With dead ends: 25742 [2023-12-25 07:26:02,333 INFO L226 Difference]: Without dead ends: 14807 [2023-12-25 07:26:02,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 840 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=513, Invalid=2139, Unknown=0, NotChecked=0, Total=2652 [2023-12-25 07:26:02,351 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 681 mSDsluCounter, 3407 mSDsCounter, 0 mSdLazyCounter, 3042 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 3777 SdHoareTripleChecker+Invalid, 3354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 3042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:26:02,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 3777 Invalid, 3354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 3042 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-25 07:26:02,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14807 states. [2023-12-25 07:26:06,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14807 to 10542. [2023-12-25 07:26:06,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10542 states, 8110 states have (on average 1.1649815043156597) internal successors, (9448), 8235 states have internal predecessors, (9448), 1546 states have call successors, (1546), 885 states have call predecessors, (1546), 885 states have return successors, (1546), 1421 states have call predecessors, (1546), 1546 states have call successors, (1546) [2023-12-25 07:26:06,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10542 states to 10542 states and 12540 transitions. [2023-12-25 07:26:06,159 INFO L78 Accepts]: Start accepts. Automaton has 10542 states and 12540 transitions. Word has length 428 [2023-12-25 07:26:06,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:26:06,160 INFO L495 AbstractCegarLoop]: Abstraction has 10542 states and 12540 transitions. [2023-12-25 07:26:06,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.7) internal successors, (214), 17 states have internal predecessors, (214), 4 states have call successors, (59), 8 states have call predecessors, (59), 14 states have return successors, (59), 7 states have call predecessors, (59), 4 states have call successors, (59) [2023-12-25 07:26:06,160 INFO L276 IsEmpty]: Start isEmpty. Operand 10542 states and 12540 transitions. [2023-12-25 07:26:06,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2023-12-25 07:26:06,171 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:26:06,171 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:06,177 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 (55)] Ended with exit code 0 [2023-12-25 07:26:06,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:26:06,377 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:26:06,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:26:06,377 INFO L85 PathProgramCache]: Analyzing trace with hash -341583539, now seen corresponding path program 1 times [2023-12-25 07:26:06,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:26:06,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629429060] [2023-12-25 07:26:06,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:26:06,378 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:26:06,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:26:06,380 INFO L229 MonitoredProcess]: Starting monitored process 56 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:26:06,392 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 (56)] Waiting until timeout for monitored process [2023-12-25 07:26:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:26:06,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 07:26:06,625 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:26:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1299 backedges. 560 proven. 89 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2023-12-25 07:26:06,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:26:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1299 backedges. 75 proven. 53 refuted. 0 times theorem prover too weak. 1171 trivial. 0 not checked. [2023-12-25 07:26:07,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:26:07,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629429060] [2023-12-25 07:26:07,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629429060] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:26:07,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:26:07,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2023-12-25 07:26:07,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251798286] [2023-12-25 07:26:07,141 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:26:07,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 07:26:07,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:26:07,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 07:26:07,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2023-12-25 07:26:07,143 INFO L87 Difference]: Start difference. First operand 10542 states and 12540 transitions. Second operand has 20 states, 20 states have (on average 10.95) internal successors, (219), 17 states have internal predecessors, (219), 4 states have call successors, (57), 8 states have call predecessors, (57), 14 states have return successors, (57), 7 states have call predecessors, (57), 4 states have call successors, (57) [2023-12-25 07:26:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:26:16,908 INFO L93 Difference]: Finished difference Result 25306 states and 30726 transitions. [2023-12-25 07:26:16,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-25 07:26:16,909 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 10.95) internal successors, (219), 17 states have internal predecessors, (219), 4 states have call successors, (57), 8 states have call predecessors, (57), 14 states have return successors, (57), 7 states have call predecessors, (57), 4 states have call successors, (57) Word has length 428 [2023-12-25 07:26:16,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:26:16,947 INFO L225 Difference]: With dead ends: 25306 [2023-12-25 07:26:16,947 INFO L226 Difference]: Without dead ends: 19317 [2023-12-25 07:26:16,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 913 GetRequests, 856 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=624, Invalid=2798, Unknown=0, NotChecked=0, Total=3422 [2023-12-25 07:26:16,960 INFO L413 NwaCegarLoop]: 457 mSDtfsCounter, 1645 mSDsluCounter, 3842 mSDsCounter, 0 mSdLazyCounter, 2689 mSolverCounterSat, 694 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1645 SdHoareTripleChecker+Valid, 4299 SdHoareTripleChecker+Invalid, 3383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 694 IncrementalHoareTripleChecker+Valid, 2689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-25 07:26:16,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1645 Valid, 4299 Invalid, 3383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [694 Valid, 2689 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-25 07:26:16,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19317 states. [2023-12-25 07:26:22,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19317 to 14396. [2023-12-25 07:26:22,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14396 states, 11050 states have (on average 1.1628054298642534) internal successors, (12849), 11233 states have internal predecessors, (12849), 2122 states have call successors, (2122), 1223 states have call predecessors, (2122), 1223 states have return successors, (2122), 1939 states have call predecessors, (2122), 2122 states have call successors, (2122) [2023-12-25 07:26:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14396 states to 14396 states and 17093 transitions. [2023-12-25 07:26:22,587 INFO L78 Accepts]: Start accepts. Automaton has 14396 states and 17093 transitions. Word has length 428 [2023-12-25 07:26:22,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:26:22,588 INFO L495 AbstractCegarLoop]: Abstraction has 14396 states and 17093 transitions. [2023-12-25 07:26:22,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.95) internal successors, (219), 17 states have internal predecessors, (219), 4 states have call successors, (57), 8 states have call predecessors, (57), 14 states have return successors, (57), 7 states have call predecessors, (57), 4 states have call successors, (57) [2023-12-25 07:26:22,589 INFO L276 IsEmpty]: Start isEmpty. Operand 14396 states and 17093 transitions. [2023-12-25 07:26:22,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2023-12-25 07:26:22,604 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:26:22,604 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 13, 13, 12, 12, 12, 9, 8, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:26:22,612 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 (56)] Forceful destruction successful, exit code 0 [2023-12-25 07:26:22,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:26:22,810 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:26:22,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:26:22,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1852364889, now seen corresponding path program 1 times [2023-12-25 07:26:22,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:26:22,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478360332] [2023-12-25 07:26:22,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:26:22,814 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:26:22,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:26:22,815 INFO L229 MonitoredProcess]: Starting monitored process 57 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:26:22,817 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 (57)] Waiting until timeout for monitored process [2023-12-25 07:26:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:26:23,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:26:23,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:26:23,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1328 backedges. 18 proven. 600 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2023-12-25 07:26:23,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:26:23,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1328 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 1284 trivial. 0 not checked. [2023-12-25 07:26:23,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:26:23,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478360332] [2023-12-25 07:26:23,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478360332] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 07:26:23,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 07:26:23,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 20 [2023-12-25 07:26:23,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992754522] [2023-12-25 07:26:23,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:26:23,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 07:26:23,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:26:23,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 07:26:23,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2023-12-25 07:26:23,900 INFO L87 Difference]: Start difference. First operand 14396 states and 17093 transitions. Second operand has 8 states, 8 states have (on average 16.625) internal successors, (133), 7 states have internal predecessors, (133), 3 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-25 07:26:30,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:26:30,731 INFO L93 Difference]: Finished difference Result 24044 states and 28569 transitions. [2023-12-25 07:26:30,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 07:26:30,732 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 7 states have internal predecessors, (133), 3 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) Word has length 430 [2023-12-25 07:26:30,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:26:30,771 INFO L225 Difference]: With dead ends: 24044 [2023-12-25 07:26:30,771 INFO L226 Difference]: Without dead ends: 16936 [2023-12-25 07:26:30,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 841 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2023-12-25 07:26:30,785 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 119 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:26:30,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1681 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:26:30,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16936 states. [2023-12-25 07:26:36,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16936 to 15350. [2023-12-25 07:26:36,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15350 states, 11762 states have (on average 1.1598367624553647) internal successors, (13642), 11959 states have internal predecessors, (13642), 2274 states have call successors, (2274), 1313 states have call predecessors, (2274), 1313 states have return successors, (2274), 2077 states have call predecessors, (2274), 2274 states have call successors, (2274) [2023-12-25 07:26:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15350 states to 15350 states and 18190 transitions. [2023-12-25 07:26:36,633 INFO L78 Accepts]: Start accepts. Automaton has 15350 states and 18190 transitions. Word has length 430 [2023-12-25 07:26:36,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:26:36,633 INFO L495 AbstractCegarLoop]: Abstraction has 15350 states and 18190 transitions. [2023-12-25 07:26:36,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 7 states have internal predecessors, (133), 3 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-25 07:26:36,633 INFO L276 IsEmpty]: Start isEmpty. Operand 15350 states and 18190 transitions. [2023-12-25 07:26:36,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2023-12-25 07:26:36,646 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:26:36,646 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 13, 13, 12, 12, 12, 9, 8, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:26:36,651 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 (57)] Ended with exit code 0 [2023-12-25 07:26:36,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:26:36,851 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:26:36,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:26:36,851 INFO L85 PathProgramCache]: Analyzing trace with hash -853407188, now seen corresponding path program 1 times [2023-12-25 07:26:36,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:26:36,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951789938] [2023-12-25 07:26:36,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:26:36,852 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:26:36,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:26:36,853 INFO L229 MonitoredProcess]: Starting monitored process 58 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:26:36,854 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 (58)] Waiting until timeout for monitored process [2023-12-25 07:26:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:26:37,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:26:37,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:26:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 81 proven. 568 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2023-12-25 07:26:37,634 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:26:37,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2023-12-25 07:26:37,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:26:37,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951789938] [2023-12-25 07:26:37,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951789938] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:26:37,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:26:37,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 20 [2023-12-25 07:26:37,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898094219] [2023-12-25 07:26:37,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:26:37,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 07:26:37,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:26:37,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 07:26:37,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2023-12-25 07:26:37,785 INFO L87 Difference]: Start difference. First operand 15350 states and 18190 transitions. Second operand has 20 states, 20 states have (on average 15.6) internal successors, (312), 18 states have internal predecessors, (312), 9 states have call successors, (68), 7 states have call predecessors, (68), 9 states have return successors, (67), 11 states have call predecessors, (67), 9 states have call successors, (67) [2023-12-25 07:26:52,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:26:52,024 INFO L93 Difference]: Finished difference Result 36368 states and 43048 transitions. [2023-12-25 07:26:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2023-12-25 07:26:52,025 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 15.6) internal successors, (312), 18 states have internal predecessors, (312), 9 states have call successors, (68), 7 states have call predecessors, (68), 9 states have return successors, (67), 11 states have call predecessors, (67), 9 states have call successors, (67) Word has length 430 [2023-12-25 07:26:52,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:26:52,090 INFO L225 Difference]: With dead ends: 36368 [2023-12-25 07:26:52,090 INFO L226 Difference]: Without dead ends: 28633 [2023-12-25 07:26:52,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 959 GetRequests, 870 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2755 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=955, Invalid=7235, Unknown=0, NotChecked=0, Total=8190 [2023-12-25 07:26:52,109 INFO L413 NwaCegarLoop]: 633 mSDtfsCounter, 1268 mSDsluCounter, 6415 mSDsCounter, 0 mSdLazyCounter, 2698 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 7048 SdHoareTripleChecker+Invalid, 3025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 2698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:26:52,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 7048 Invalid, 3025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 2698 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-25 07:26:52,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28633 states. [2023-12-25 07:26:59,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28633 to 16531. [2023-12-25 07:26:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16531 states, 12638 states have (on average 1.1575407501186896) internal successors, (14629), 12877 states have internal predecessors, (14629), 2464 states have call successors, (2464), 1428 states have call predecessors, (2464), 1428 states have return successors, (2464), 2225 states have call predecessors, (2464), 2464 states have call successors, (2464) [2023-12-25 07:26:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16531 states to 16531 states and 19557 transitions. [2023-12-25 07:26:59,238 INFO L78 Accepts]: Start accepts. Automaton has 16531 states and 19557 transitions. Word has length 430 [2023-12-25 07:26:59,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:26:59,239 INFO L495 AbstractCegarLoop]: Abstraction has 16531 states and 19557 transitions. [2023-12-25 07:26:59,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 15.6) internal successors, (312), 18 states have internal predecessors, (312), 9 states have call successors, (68), 7 states have call predecessors, (68), 9 states have return successors, (67), 11 states have call predecessors, (67), 9 states have call successors, (67) [2023-12-25 07:26:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 16531 states and 19557 transitions. [2023-12-25 07:26:59,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2023-12-25 07:26:59,274 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:26:59,274 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:59,294 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 (58)] Forceful destruction successful, exit code 0 [2023-12-25 07:26:59,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:26:59,480 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:26:59,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:26:59,481 INFO L85 PathProgramCache]: Analyzing trace with hash -326252573, now seen corresponding path program 1 times [2023-12-25 07:26:59,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:26:59,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692145246] [2023-12-25 07:26:59,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:26:59,481 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:26:59,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:26:59,483 INFO L229 MonitoredProcess]: Starting monitored process 59 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:26:59,485 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 (59)] Waiting until timeout for monitored process [2023-12-25 07:26:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:26:59,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 07:26:59,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:26:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1320 backedges. 561 proven. 89 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2023-12-25 07:26:59,998 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:27:00,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1320 backedges. 90 proven. 34 refuted. 0 times theorem prover too weak. 1196 trivial. 0 not checked. [2023-12-25 07:27:00,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:27:00,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1692145246] [2023-12-25 07:27:00,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1692145246] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:27:00,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:27:00,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2023-12-25 07:27:00,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341487325] [2023-12-25 07:27:00,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:27:00,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 07:27:00,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:27:00,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 07:27:00,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-12-25 07:27:00,334 INFO L87 Difference]: Start difference. First operand 16531 states and 19557 transitions. Second operand has 18 states, 18 states have (on average 11.666666666666666) internal successors, (210), 15 states have internal predecessors, (210), 4 states have call successors, (57), 6 states have call predecessors, (57), 12 states have return successors, (57), 7 states have call predecessors, (57), 4 states have call successors, (57) [2023-12-25 07:27:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:27:18,341 INFO L93 Difference]: Finished difference Result 47493 states and 57506 transitions. [2023-12-25 07:27:18,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-25 07:27:18,342 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 11.666666666666666) internal successors, (210), 15 states have internal predecessors, (210), 4 states have call successors, (57), 6 states have call predecessors, (57), 12 states have return successors, (57), 7 states have call predecessors, (57), 4 states have call successors, (57) Word has length 433 [2023-12-25 07:27:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:27:18,445 INFO L225 Difference]: With dead ends: 47493 [2023-12-25 07:27:18,445 INFO L226 Difference]: Without dead ends: 37087 [2023-12-25 07:27:18,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 911 GetRequests, 862 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=453, Invalid=2097, Unknown=0, NotChecked=0, Total=2550 [2023-12-25 07:27:18,470 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 912 mSDsluCounter, 3829 mSDsCounter, 0 mSdLazyCounter, 3016 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 4253 SdHoareTripleChecker+Invalid, 3319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 3016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-25 07:27:18,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 4253 Invalid, 3319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 3016 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-25 07:27:18,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37087 states. [2023-12-25 07:27:28,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37087 to 22417. [2023-12-25 07:27:28,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22417 states, 17156 states have (on average 1.1532991373280486) internal successors, (19786), 17465 states have internal predecessors, (19786), 3292 states have call successors, (3292), 1968 states have call predecessors, (3292), 1968 states have return successors, (3292), 2983 states have call predecessors, (3292), 3292 states have call successors, (3292) [2023-12-25 07:27:28,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22417 states to 22417 states and 26370 transitions. [2023-12-25 07:27:28,715 INFO L78 Accepts]: Start accepts. Automaton has 22417 states and 26370 transitions. Word has length 433 [2023-12-25 07:27:28,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:27:28,716 INFO L495 AbstractCegarLoop]: Abstraction has 22417 states and 26370 transitions. [2023-12-25 07:27:28,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.666666666666666) internal successors, (210), 15 states have internal predecessors, (210), 4 states have call successors, (57), 6 states have call predecessors, (57), 12 states have return successors, (57), 7 states have call predecessors, (57), 4 states have call successors, (57) [2023-12-25 07:27:28,716 INFO L276 IsEmpty]: Start isEmpty. Operand 22417 states and 26370 transitions. [2023-12-25 07:27:28,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2023-12-25 07:27:28,736 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:27:28,736 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 13, 13, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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:27:28,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 (59)] Forceful destruction successful, exit code 0 [2023-12-25 07:27:28,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:27:28,941 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:27:28,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:27:28,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1442473146, now seen corresponding path program 1 times [2023-12-25 07:27:28,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:27:28,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944755792] [2023-12-25 07:27:28,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:27:28,942 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:27:28,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:27:28,943 INFO L229 MonitoredProcess]: Starting monitored process 60 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:27:28,945 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 (60)] Waiting until timeout for monitored process [2023-12-25 07:27:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:27:29,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 07:27:29,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:27:29,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 555 proven. 68 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2023-12-25 07:27:29,690 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:27:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 1318 trivial. 0 not checked. [2023-12-25 07:27:29,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:27:29,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944755792] [2023-12-25 07:27:29,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944755792] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:27:29,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:27:29,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-25 07:27:29,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796189483] [2023-12-25 07:27:29,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:27:29,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 07:27:29,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:27:29,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 07:27:29,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 07:27:29,834 INFO L87 Difference]: Start difference. First operand 22417 states and 26370 transitions. Second operand has 9 states, 9 states have (on average 32.888888888888886) internal successors, (296), 9 states have internal predecessors, (296), 7 states have call successors, (73), 5 states have call predecessors, (73), 5 states have return successors, (72), 7 states have call predecessors, (72), 7 states have call successors, (72) [2023-12-25 07:27:40,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:27:40,030 INFO L93 Difference]: Finished difference Result 35067 states and 41382 transitions. [2023-12-25 07:27:40,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 07:27:40,031 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 32.888888888888886) internal successors, (296), 9 states have internal predecessors, (296), 7 states have call successors, (73), 5 states have call predecessors, (73), 5 states have return successors, (72), 7 states have call predecessors, (72), 7 states have call successors, (72) Word has length 438 [2023-12-25 07:27:40,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:27:40,098 INFO L225 Difference]: With dead ends: 35067 [2023-12-25 07:27:40,098 INFO L226 Difference]: Without dead ends: 22408 [2023-12-25 07:27:40,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 882 GetRequests, 869 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-25 07:27:40,119 INFO L413 NwaCegarLoop]: 416 mSDtfsCounter, 706 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 07:27:40,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1259 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 07:27:40,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22408 states. [2023-12-25 07:27:45,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22408 to 10496. [2023-12-25 07:27:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10496 states, 8077 states have (on average 1.1459700383805869) internal successors, (9256), 8194 states have internal predecessors, (9256), 1489 states have call successors, (1489), 929 states have call predecessors, (1489), 929 states have return successors, (1489), 1372 states have call predecessors, (1489), 1489 states have call successors, (1489) [2023-12-25 07:27:45,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10496 states to 10496 states and 12234 transitions. [2023-12-25 07:27:45,430 INFO L78 Accepts]: Start accepts. Automaton has 10496 states and 12234 transitions. Word has length 438 [2023-12-25 07:27:45,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:27:45,431 INFO L495 AbstractCegarLoop]: Abstraction has 10496 states and 12234 transitions. [2023-12-25 07:27:45,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 32.888888888888886) internal successors, (296), 9 states have internal predecessors, (296), 7 states have call successors, (73), 5 states have call predecessors, (73), 5 states have return successors, (72), 7 states have call predecessors, (72), 7 states have call successors, (72) [2023-12-25 07:27:45,431 INFO L276 IsEmpty]: Start isEmpty. Operand 10496 states and 12234 transitions. [2023-12-25 07:27:45,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2023-12-25 07:27:45,440 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:27:45,441 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 12, 12, 12, 9, 9, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:27:45,446 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 (60)] Ended with exit code 0 [2023-12-25 07:27:45,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:27:45,646 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:27:45,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:27:45,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1758707558, now seen corresponding path program 1 times [2023-12-25 07:27:45,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:27:45,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212317083] [2023-12-25 07:27:45,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:27:45,647 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:27:45,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:27:45,648 INFO L229 MonitoredProcess]: Starting monitored process 61 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:27:45,655 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 (61)] Waiting until timeout for monitored process [2023-12-25 07:27:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:27:45,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:27:45,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:27:46,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 134 proven. 594 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2023-12-25 07:27:46,544 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:27:46,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 43 proven. 4 refuted. 0 times theorem prover too weak. 1351 trivial. 0 not checked. [2023-12-25 07:27:46,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:27:46,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212317083] [2023-12-25 07:27:46,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212317083] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:27:46,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:27:46,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 20 [2023-12-25 07:27:46,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614419981] [2023-12-25 07:27:46,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:27:46,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 07:27:46,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:27:46,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 07:27:46,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2023-12-25 07:27:46,724 INFO L87 Difference]: Start difference. First operand 10496 states and 12234 transitions. Second operand has 20 states, 20 states have (on average 15.55) internal successors, (311), 18 states have internal predecessors, (311), 9 states have call successors, (69), 7 states have call predecessors, (69), 9 states have return successors, (68), 11 states have call predecessors, (68), 9 states have call successors, (68) [2023-12-25 07:28:02,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:28:02,233 INFO L93 Difference]: Finished difference Result 34244 states and 39849 transitions. [2023-12-25 07:28:02,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-12-25 07:28:02,234 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 15.55) internal successors, (311), 18 states have internal predecessors, (311), 9 states have call successors, (69), 7 states have call predecessors, (69), 9 states have return successors, (68), 11 states have call predecessors, (68), 9 states have call successors, (68) Word has length 439 [2023-12-25 07:28:02,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:28:02,301 INFO L225 Difference]: With dead ends: 34244 [2023-12-25 07:28:02,301 INFO L226 Difference]: Without dead ends: 28517 [2023-12-25 07:28:02,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 963 GetRequests, 883 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2176 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=828, Invalid=5814, Unknown=0, NotChecked=0, Total=6642 [2023-12-25 07:28:02,325 INFO L413 NwaCegarLoop]: 502 mSDtfsCounter, 1084 mSDsluCounter, 5400 mSDsCounter, 0 mSdLazyCounter, 2298 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 5902 SdHoareTripleChecker+Invalid, 2581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 2298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:28:02,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 5902 Invalid, 2581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 2298 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-25 07:28:02,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28517 states. [2023-12-25 07:28:07,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28517 to 10058. [2023-12-25 07:28:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10058 states, 7785 states have (on average 1.129479768786127) internal successors, (8793), 7890 states have internal predecessors, (8793), 1355 states have call successors, (1355), 917 states have call predecessors, (1355), 917 states have return successors, (1355), 1250 states have call predecessors, (1355), 1355 states have call successors, (1355) [2023-12-25 07:28:07,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10058 states to 10058 states and 11503 transitions. [2023-12-25 07:28:07,331 INFO L78 Accepts]: Start accepts. Automaton has 10058 states and 11503 transitions. Word has length 439 [2023-12-25 07:28:07,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:28:07,331 INFO L495 AbstractCegarLoop]: Abstraction has 10058 states and 11503 transitions. [2023-12-25 07:28:07,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 15.55) internal successors, (311), 18 states have internal predecessors, (311), 9 states have call successors, (69), 7 states have call predecessors, (69), 9 states have return successors, (68), 11 states have call predecessors, (68), 9 states have call successors, (68) [2023-12-25 07:28:07,331 INFO L276 IsEmpty]: Start isEmpty. Operand 10058 states and 11503 transitions. [2023-12-25 07:28:07,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2023-12-25 07:28:07,340 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:28:07,341 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:07,345 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 (61)] Forceful destruction successful, exit code 0 [2023-12-25 07:28:07,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:28:07,545 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:28:07,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:28:07,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1716071297, now seen corresponding path program 1 times [2023-12-25 07:28:07,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:28:07,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875735863] [2023-12-25 07:28:07,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:28:07,547 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:28:07,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:28:07,548 INFO L229 MonitoredProcess]: Starting monitored process 62 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:28:07,549 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 (62)] Waiting until timeout for monitored process [2023-12-25 07:28:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:28:07,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 07:28:07,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:28:08,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 69 proven. 627 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2023-12-25 07:28:08,790 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:28:09,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 27 proven. 37 refuted. 0 times theorem prover too weak. 1280 trivial. 0 not checked. [2023-12-25 07:28:09,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:28:09,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875735863] [2023-12-25 07:28:09,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875735863] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:28:09,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:28:09,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2023-12-25 07:28:09,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134891293] [2023-12-25 07:28:09,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:28:09,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-25 07:28:09,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:28:09,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-25 07:28:09,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2023-12-25 07:28:09,328 INFO L87 Difference]: Start difference. First operand 10058 states and 11503 transitions. Second operand has 29 states, 29 states have (on average 11.482758620689655) internal successors, (333), 27 states have internal predecessors, (333), 17 states have call successors, (73), 8 states have call predecessors, (73), 10 states have return successors, (72), 19 states have call predecessors, (72), 17 states have call successors, (72) [2023-12-25 07:28:32,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:28:32,837 INFO L93 Difference]: Finished difference Result 32100 states and 37152 transitions. [2023-12-25 07:28:32,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2023-12-25 07:28:32,837 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 11.482758620689655) internal successors, (333), 27 states have internal predecessors, (333), 17 states have call successors, (73), 8 states have call predecessors, (73), 10 states have return successors, (72), 19 states have call predecessors, (72), 17 states have call successors, (72) Word has length 440 [2023-12-25 07:28:32,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:28:32,890 INFO L225 Difference]: With dead ends: 32100 [2023-12-25 07:28:32,891 INFO L226 Difference]: Without dead ends: 25277 [2023-12-25 07:28:32,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1098 GetRequests, 908 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13073 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3703, Invalid=32969, Unknown=0, NotChecked=0, Total=36672 [2023-12-25 07:28:32,904 INFO L413 NwaCegarLoop]: 1662 mSDtfsCounter, 2130 mSDsluCounter, 19289 mSDsCounter, 0 mSdLazyCounter, 12430 mSolverCounterSat, 667 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2136 SdHoareTripleChecker+Valid, 20951 SdHoareTripleChecker+Invalid, 13097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 667 IncrementalHoareTripleChecker+Valid, 12430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:28:32,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2136 Valid, 20951 Invalid, 13097 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [667 Valid, 12430 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2023-12-25 07:28:32,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25277 states. [2023-12-25 07:28:39,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25277 to 13668. [2023-12-25 07:28:39,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13668 states, 10529 states have (on average 1.1303067717731978) internal successors, (11901), 10725 states have internal predecessors, (11901), 1887 states have call successors, (1887), 1251 states have call predecessors, (1887), 1251 states have return successors, (1887), 1691 states have call predecessors, (1887), 1887 states have call successors, (1887) [2023-12-25 07:28:39,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13668 states to 13668 states and 15675 transitions. [2023-12-25 07:28:39,760 INFO L78 Accepts]: Start accepts. Automaton has 13668 states and 15675 transitions. Word has length 440 [2023-12-25 07:28:39,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:28:39,760 INFO L495 AbstractCegarLoop]: Abstraction has 13668 states and 15675 transitions. [2023-12-25 07:28:39,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 11.482758620689655) internal successors, (333), 27 states have internal predecessors, (333), 17 states have call successors, (73), 8 states have call predecessors, (73), 10 states have return successors, (72), 19 states have call predecessors, (72), 17 states have call successors, (72) [2023-12-25 07:28:39,761 INFO L276 IsEmpty]: Start isEmpty. Operand 13668 states and 15675 transitions. [2023-12-25 07:28:39,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2023-12-25 07:28:39,775 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:28:39,775 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:39,783 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 (62)] Forceful destruction successful, exit code 0 [2023-12-25 07:28:39,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:28:39,982 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:28:39,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:28:39,982 INFO L85 PathProgramCache]: Analyzing trace with hash -598875263, now seen corresponding path program 1 times [2023-12-25 07:28:39,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:28:39,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477720066] [2023-12-25 07:28:39,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:28:39,983 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:28:39,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:28:39,984 INFO L229 MonitoredProcess]: Starting monitored process 63 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:28:40,016 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 (63)] Waiting until timeout for monitored process [2023-12-25 07:28:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:28:40,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 07:28:40,228 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:28:40,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1343 backedges. 364 proven. 310 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2023-12-25 07:28:40,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:28:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1343 backedges. 29 proven. 14 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2023-12-25 07:28:41,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:28:41,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477720066] [2023-12-25 07:28:41,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477720066] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:28:41,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:28:41,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-25 07:28:41,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449254949] [2023-12-25 07:28:41,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:28:41,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 07:28:41,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:28:41,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 07:28:41,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-12-25 07:28:41,327 INFO L87 Difference]: Start difference. First operand 13668 states and 15675 transitions. Second operand has 17 states, 17 states have (on average 18.176470588235293) internal successors, (309), 17 states have internal predecessors, (309), 13 states have call successors, (73), 6 states have call predecessors, (73), 6 states have return successors, (72), 13 states have call predecessors, (72), 13 states have call successors, (72) [2023-12-25 07:29:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:29:02,211 INFO L93 Difference]: Finished difference Result 43384 states and 49862 transitions. [2023-12-25 07:29:02,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-12-25 07:29:02,212 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 18.176470588235293) internal successors, (309), 17 states have internal predecessors, (309), 13 states have call successors, (73), 6 states have call predecessors, (73), 6 states have return successors, (72), 13 states have call predecessors, (72), 13 states have call successors, (72) Word has length 443 [2023-12-25 07:29:02,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:29:02,299 INFO L225 Difference]: With dead ends: 43384 [2023-12-25 07:29:02,299 INFO L226 Difference]: Without dead ends: 35039 [2023-12-25 07:29:02,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 958 GetRequests, 894 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1173 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=820, Invalid=3470, Unknown=0, NotChecked=0, Total=4290 [2023-12-25 07:29:02,317 INFO L413 NwaCegarLoop]: 1044 mSDtfsCounter, 1542 mSDsluCounter, 4437 mSDsCounter, 0 mSdLazyCounter, 3084 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 5481 SdHoareTripleChecker+Invalid, 3533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 3084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-25 07:29:02,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 5481 Invalid, 3533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 3084 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-25 07:29:02,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35039 states. [2023-12-25 07:29:11,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35039 to 17739. [2023-12-25 07:29:11,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17739 states, 13658 states have (on average 1.1345731439449407) internal successors, (15496), 13929 states have internal predecessors, (15496), 2457 states have call successors, (2457), 1623 states have call predecessors, (2457), 1623 states have return successors, (2457), 2186 states have call predecessors, (2457), 2457 states have call successors, (2457) [2023-12-25 07:29:11,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17739 states to 17739 states and 20410 transitions. [2023-12-25 07:29:11,670 INFO L78 Accepts]: Start accepts. Automaton has 17739 states and 20410 transitions. Word has length 443 [2023-12-25 07:29:11,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:29:11,671 INFO L495 AbstractCegarLoop]: Abstraction has 17739 states and 20410 transitions. [2023-12-25 07:29:11,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 18.176470588235293) internal successors, (309), 17 states have internal predecessors, (309), 13 states have call successors, (73), 6 states have call predecessors, (73), 6 states have return successors, (72), 13 states have call predecessors, (72), 13 states have call successors, (72) [2023-12-25 07:29:11,671 INFO L276 IsEmpty]: Start isEmpty. Operand 17739 states and 20410 transitions. [2023-12-25 07:29:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2023-12-25 07:29:11,686 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:29:11,686 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:11,691 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 (63)] Forceful destruction successful, exit code 0 [2023-12-25 07:29:11,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:29:11,892 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:29:11,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:29:11,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1775342017, now seen corresponding path program 1 times [2023-12-25 07:29:11,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:29:11,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065790642] [2023-12-25 07:29:11,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:29:11,893 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:29:11,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:29:11,896 INFO L229 MonitoredProcess]: Starting monitored process 64 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:29:11,901 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 (64)] Waiting until timeout for monitored process [2023-12-25 07:29:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:29:12,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 07:29:12,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:29:13,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1343 backedges. 22 proven. 656 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked. [2023-12-25 07:29:13,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:29:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1343 backedges. 26 proven. 37 refuted. 0 times theorem prover too weak. 1280 trivial. 0 not checked. [2023-12-25 07:29:13,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:29:13,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065790642] [2023-12-25 07:29:13,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065790642] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:29:13,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:29:13,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2023-12-25 07:29:13,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140005964] [2023-12-25 07:29:13,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:29:13,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-25 07:29:13,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:29:13,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-25 07:29:13,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2023-12-25 07:29:13,710 INFO L87 Difference]: Start difference. First operand 17739 states and 20410 transitions. Second operand has 29 states, 29 states have (on average 11.379310344827585) internal successors, (330), 27 states have internal predecessors, (330), 15 states have call successors, (73), 7 states have call predecessors, (73), 8 states have return successors, (72), 16 states have call predecessors, (72), 14 states have call successors, (72) [2023-12-25 07:29:46,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:29:46,131 INFO L93 Difference]: Finished difference Result 59492 states and 68904 transitions. [2023-12-25 07:29:46,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2023-12-25 07:29:46,132 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 11.379310344827585) internal successors, (330), 27 states have internal predecessors, (330), 15 states have call successors, (73), 7 states have call predecessors, (73), 8 states have return successors, (72), 16 states have call predecessors, (72), 14 states have call successors, (72) Word has length 443 [2023-12-25 07:29:46,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:29:46,220 INFO L225 Difference]: With dead ends: 59492 [2023-12-25 07:29:46,220 INFO L226 Difference]: Without dead ends: 42687 [2023-12-25 07:29:46,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1090 GetRequests, 900 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13306 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3703, Invalid=32969, Unknown=0, NotChecked=0, Total=36672 [2023-12-25 07:29:46,247 INFO L413 NwaCegarLoop]: 1057 mSDtfsCounter, 2617 mSDsluCounter, 12336 mSDsCounter, 0 mSdLazyCounter, 10001 mSolverCounterSat, 861 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2624 SdHoareTripleChecker+Valid, 13393 SdHoareTripleChecker+Invalid, 10862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 861 IncrementalHoareTripleChecker+Valid, 10001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:29:46,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2624 Valid, 13393 Invalid, 10862 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [861 Valid, 10001 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2023-12-25 07:29:46,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42687 states. [2023-12-25 07:29:57,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42687 to 21325. [2023-12-25 07:29:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21325 states, 16387 states have (on average 1.1263196436199427) internal successors, (18457), 16711 states have internal predecessors, (18457), 3002 states have call successors, (3002), 1935 states have call predecessors, (3002), 1935 states have return successors, (3002), 2678 states have call predecessors, (3002), 3002 states have call successors, (3002) [2023-12-25 07:29:57,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21325 states to 21325 states and 24461 transitions. [2023-12-25 07:29:57,471 INFO L78 Accepts]: Start accepts. Automaton has 21325 states and 24461 transitions. Word has length 443 [2023-12-25 07:29:57,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:29:57,472 INFO L495 AbstractCegarLoop]: Abstraction has 21325 states and 24461 transitions. [2023-12-25 07:29:57,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 11.379310344827585) internal successors, (330), 27 states have internal predecessors, (330), 15 states have call successors, (73), 7 states have call predecessors, (73), 8 states have return successors, (72), 16 states have call predecessors, (72), 14 states have call successors, (72) [2023-12-25 07:29:57,472 INFO L276 IsEmpty]: Start isEmpty. Operand 21325 states and 24461 transitions. [2023-12-25 07:29:57,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2023-12-25 07:29:57,492 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:29:57,492 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:57,497 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 (64)] Forceful destruction successful, exit code 0 [2023-12-25 07:29:57,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:29:57,698 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:29:57,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:29:57,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1792918595, now seen corresponding path program 1 times [2023-12-25 07:29:57,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:29:57,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911419733] [2023-12-25 07:29:57,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:29:57,699 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:29:57,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:29:57,701 INFO L229 MonitoredProcess]: Starting monitored process 65 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:29:57,702 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 (65)] Waiting until timeout for monitored process [2023-12-25 07:29:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:29:57,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 07:29:57,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:29:58,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1343 backedges. 17 proven. 657 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2023-12-25 07:29:58,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:29:59,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1343 backedges. 5 proven. 38 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2023-12-25 07:29:59,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:29:59,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911419733] [2023-12-25 07:29:59,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [911419733] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:29:59,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:29:59,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-25 07:29:59,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90783115] [2023-12-25 07:29:59,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:29:59,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 07:29:59,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:29:59,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 07:29:59,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-12-25 07:29:59,325 INFO L87 Difference]: Start difference. First operand 21325 states and 24461 transitions. Second operand has 17 states, 17 states have (on average 19.294117647058822) internal successors, (328), 17 states have internal predecessors, (328), 15 states have call successors, (73), 7 states have call predecessors, (73), 6 states have return successors, (72), 14 states have call predecessors, (72), 14 states have call successors, (72) [2023-12-25 07:30:41,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:30:41,394 INFO L93 Difference]: Finished difference Result 76177 states and 88223 transitions. [2023-12-25 07:30:41,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2023-12-25 07:30:41,395 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 19.294117647058822) internal successors, (328), 17 states have internal predecessors, (328), 15 states have call successors, (73), 7 states have call predecessors, (73), 6 states have return successors, (72), 14 states have call predecessors, (72), 14 states have call successors, (72) Word has length 443 [2023-12-25 07:30:41,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:30:41,558 INFO L225 Difference]: With dead ends: 76177 [2023-12-25 07:30:41,559 INFO L226 Difference]: Without dead ends: 62578 [2023-12-25 07:30:41,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1044 GetRequests, 902 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7095 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3401, Invalid=17191, Unknown=0, NotChecked=0, Total=20592 [2023-12-25 07:30:41,592 INFO L413 NwaCegarLoop]: 1383 mSDtfsCounter, 1290 mSDsluCounter, 8809 mSDsCounter, 0 mSdLazyCounter, 6358 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 10192 SdHoareTripleChecker+Invalid, 6686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 6358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-25 07:30:41,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 10192 Invalid, 6686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 6358 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-12-25 07:30:41,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62578 states. [2023-12-25 07:30:57,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62578 to 28688. [2023-12-25 07:30:57,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28688 states, 21979 states have (on average 1.1293507438918968) internal successors, (24822), 22530 states have internal predecessors, (24822), 4145 states have call successors, (4145), 2563 states have call predecessors, (4145), 2563 states have return successors, (4145), 3594 states have call predecessors, (4145), 4145 states have call successors, (4145) [2023-12-25 07:30:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28688 states to 28688 states and 33112 transitions. [2023-12-25 07:30:57,512 INFO L78 Accepts]: Start accepts. Automaton has 28688 states and 33112 transitions. Word has length 443 [2023-12-25 07:30:57,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:30:57,513 INFO L495 AbstractCegarLoop]: Abstraction has 28688 states and 33112 transitions. [2023-12-25 07:30:57,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 19.294117647058822) internal successors, (328), 17 states have internal predecessors, (328), 15 states have call successors, (73), 7 states have call predecessors, (73), 6 states have return successors, (72), 14 states have call predecessors, (72), 14 states have call successors, (72) [2023-12-25 07:30:57,513 INFO L276 IsEmpty]: Start isEmpty. Operand 28688 states and 33112 transitions. [2023-12-25 07:30:57,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2023-12-25 07:30:57,544 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:30:57,544 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:57,551 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 (65)] Forceful destruction successful, exit code 0 [2023-12-25 07:30:57,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:30:57,750 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:30:57,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:30:57,751 INFO L85 PathProgramCache]: Analyzing trace with hash 77716992, now seen corresponding path program 1 times [2023-12-25 07:30:57,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:30:57,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1350896287] [2023-12-25 07:30:57,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:30:57,752 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:30:57,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:30:57,755 INFO L229 MonitoredProcess]: Starting monitored process 66 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:30:57,756 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 (66)] Waiting until timeout for monitored process [2023-12-25 07:30:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:30:58,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 07:30:58,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:30:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1342 backedges. 68 proven. 626 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2023-12-25 07:30:58,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:30:59,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1342 backedges. 26 proven. 36 refuted. 0 times theorem prover too weak. 1280 trivial. 0 not checked. [2023-12-25 07:30:59,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:30:59,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1350896287] [2023-12-25 07:30:59,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1350896287] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:30:59,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:30:59,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2023-12-25 07:30:59,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711026967] [2023-12-25 07:30:59,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:30:59,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-25 07:30:59,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:30:59,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-25 07:30:59,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2023-12-25 07:30:59,529 INFO L87 Difference]: Start difference. First operand 28688 states and 33112 transitions. Second operand has 29 states, 29 states have (on average 11.689655172413794) internal successors, (339), 27 states have internal predecessors, (339), 17 states have call successors, (73), 8 states have call predecessors, (73), 10 states have return successors, (72), 19 states have call predecessors, (72), 17 states have call successors, (72) [2023-12-25 07:32:16,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:32:16,710 INFO L93 Difference]: Finished difference Result 114343 states and 133829 transitions. [2023-12-25 07:32:16,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 294 states. [2023-12-25 07:32:16,711 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 11.689655172413794) internal successors, (339), 27 states have internal predecessors, (339), 17 states have call successors, (73), 8 states have call predecessors, (73), 10 states have return successors, (72), 19 states have call predecessors, (72), 17 states have call successors, (72) Word has length 444 [2023-12-25 07:32:16,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:32:17,165 INFO L225 Difference]: With dead ends: 114343 [2023-12-25 07:32:17,166 INFO L226 Difference]: Without dead ends: 96669 [2023-12-25 07:32:17,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1242 GetRequests, 928 SyntacticMatches, 0 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39618 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=9776, Invalid=89764, Unknown=0, NotChecked=0, Total=99540 [2023-12-25 07:32:17,217 INFO L413 NwaCegarLoop]: 1810 mSDtfsCounter, 1860 mSDsluCounter, 21957 mSDsCounter, 0 mSdLazyCounter, 14030 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1868 SdHoareTripleChecker+Valid, 23767 SdHoareTripleChecker+Invalid, 14544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 14030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2023-12-25 07:32:17,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1868 Valid, 23767 Invalid, 14544 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [514 Valid, 14030 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2023-12-25 07:32:17,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96669 states. [2023-12-25 07:32:39,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96669 to 37994. [2023-12-25 07:32:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37994 states, 29142 states have (on average 1.12816553428042) internal successors, (32877), 29865 states have internal predecessors, (32877), 5481 states have call successors, (5481), 3370 states have call predecessors, (5481), 3370 states have return successors, (5481), 4758 states have call predecessors, (5481), 5481 states have call successors, (5481) [2023-12-25 07:32:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37994 states to 37994 states and 43839 transitions. [2023-12-25 07:32:39,370 INFO L78 Accepts]: Start accepts. Automaton has 37994 states and 43839 transitions. Word has length 444 [2023-12-25 07:32:39,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:32:39,371 INFO L495 AbstractCegarLoop]: Abstraction has 37994 states and 43839 transitions. [2023-12-25 07:32:39,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 11.689655172413794) internal successors, (339), 27 states have internal predecessors, (339), 17 states have call successors, (73), 8 states have call predecessors, (73), 10 states have return successors, (72), 19 states have call predecessors, (72), 17 states have call successors, (72) [2023-12-25 07:32:39,371 INFO L276 IsEmpty]: Start isEmpty. Operand 37994 states and 43839 transitions. [2023-12-25 07:32:39,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2023-12-25 07:32:39,415 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:32:39,415 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:39,422 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 (66)] Forceful destruction successful, exit code 0 [2023-12-25 07:32:39,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:32:39,622 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:32:39,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:32:39,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1916427714, now seen corresponding path program 1 times [2023-12-25 07:32:39,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:32:39,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573991208] [2023-12-25 07:32:39,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:32:39,623 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:32:39,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:32:39,624 INFO L229 MonitoredProcess]: Starting monitored process 67 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:32:39,776 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 (67)] Waiting until timeout for monitored process [2023-12-25 07:32:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:32:40,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 07:32:40,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:32:41,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1342 backedges. 21 proven. 656 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked. [2023-12-25 07:32:41,006 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:32:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1342 backedges. 25 proven. 37 refuted. 0 times theorem prover too weak. 1280 trivial. 0 not checked. [2023-12-25 07:32:41,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:32:41,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573991208] [2023-12-25 07:32:41,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573991208] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:32:41,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:32:41,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2023-12-25 07:32:41,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480133913] [2023-12-25 07:32:41,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:32:41,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-25 07:32:41,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:32:41,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-25 07:32:41,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2023-12-25 07:32:41,631 INFO L87 Difference]: Start difference. First operand 37994 states and 43839 transitions. Second operand has 29 states, 29 states have (on average 11.413793103448276) internal successors, (331), 27 states have internal predecessors, (331), 15 states have call successors, (73), 7 states have call predecessors, (73), 8 states have return successors, (72), 16 states have call predecessors, (72), 14 states have call successors, (72) [2023-12-25 07:33:57,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:33:57,203 INFO L93 Difference]: Finished difference Result 114366 states and 133243 transitions. [2023-12-25 07:33:57,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 265 states. [2023-12-25 07:33:57,204 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 11.413793103448276) internal successors, (331), 27 states have internal predecessors, (331), 15 states have call successors, (73), 7 states have call predecessors, (73), 8 states have return successors, (72), 16 states have call predecessors, (72), 14 states have call successors, (72) Word has length 444 [2023-12-25 07:33:57,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:33:57,526 INFO L225 Difference]: With dead ends: 114366 [2023-12-25 07:33:57,527 INFO L226 Difference]: Without dead ends: 94312 [2023-12-25 07:33:57,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1189 GetRequests, 904 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31687 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=8050, Invalid=74032, Unknown=0, NotChecked=0, Total=82082 [2023-12-25 07:33:57,734 INFO L413 NwaCegarLoop]: 1570 mSDtfsCounter, 1396 mSDsluCounter, 19731 mSDsCounter, 0 mSdLazyCounter, 14382 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1403 SdHoareTripleChecker+Valid, 21301 SdHoareTripleChecker+Invalid, 14739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 14382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:33:57,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1403 Valid, 21301 Invalid, 14739 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [357 Valid, 14382 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2023-12-25 07:33:57,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94312 states. [2023-12-25 07:34:21,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94312 to 40544. [2023-12-25 07:34:21,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40544 states, 31016 states have (on average 1.1232912045395924) internal successors, (34840), 31807 states have internal predecessors, (34840), 5944 states have call successors, (5944), 3583 states have call predecessors, (5944), 3583 states have return successors, (5944), 5153 states have call predecessors, (5944), 5944 states have call successors, (5944) [2023-12-25 07:34:21,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40544 states to 40544 states and 46728 transitions. [2023-12-25 07:34:21,603 INFO L78 Accepts]: Start accepts. Automaton has 40544 states and 46728 transitions. Word has length 444 [2023-12-25 07:34:21,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:34:21,604 INFO L495 AbstractCegarLoop]: Abstraction has 40544 states and 46728 transitions. [2023-12-25 07:34:21,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 11.413793103448276) internal successors, (331), 27 states have internal predecessors, (331), 15 states have call successors, (73), 7 states have call predecessors, (73), 8 states have return successors, (72), 16 states have call predecessors, (72), 14 states have call successors, (72) [2023-12-25 07:34:21,604 INFO L276 IsEmpty]: Start isEmpty. Operand 40544 states and 46728 transitions. [2023-12-25 07:34:21,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2023-12-25 07:34:21,651 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:34:21,651 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:21,659 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 (67)] Forceful destruction successful, exit code 0 [2023-12-25 07:34:21,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:34:21,857 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:34:21,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:34:21,858 INFO L85 PathProgramCache]: Analyzing trace with hash 8911861, now seen corresponding path program 1 times [2023-12-25 07:34:21,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:34:21,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912149512] [2023-12-25 07:34:21,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:34:21,858 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:34:21,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:34:21,860 INFO L229 MonitoredProcess]: Starting monitored process 68 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:34:21,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (68)] Waiting until timeout for monitored process [2023-12-25 07:34:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 07:34:22,173 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 07:34:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 07:34:22,741 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 07:34:22,742 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 07:34:22,742 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 07:34:22,765 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 (68)] Forceful destruction successful, exit code 0 [2023-12-25 07:34:22,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.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:34:22,956 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, 1, 1, 1, 1, 1, 1, 1, 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:34:22,960 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 07:34:23,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 07:34:23 BoogieIcfgContainer [2023-12-25 07:34:23,134 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 07:34:23,134 INFO L158 Benchmark]: Toolchain (without parser) took 678731.39ms. Allocated memory was 264.2MB in the beginning and 4.0GB in the end (delta: 3.7GB). Free memory was 212.2MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2023-12-25 07:34:23,135 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 173.0MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 07:34:23,135 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.65ms. Allocated memory is still 264.2MB. Free memory was 212.2MB in the beginning and 195.0MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-25 07:34:23,135 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.15ms. Allocated memory is still 264.2MB. Free memory was 195.0MB in the beginning and 192.3MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 07:34:23,135 INFO L158 Benchmark]: Boogie Preprocessor took 61.61ms. Allocated memory is still 264.2MB. Free memory was 192.3MB in the beginning and 188.7MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 07:34:23,135 INFO L158 Benchmark]: RCFGBuilder took 652.08ms. Allocated memory is still 264.2MB. Free memory was 188.7MB in the beginning and 227.3MB in the end (delta: -38.6MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2023-12-25 07:34:23,135 INFO L158 Benchmark]: TraceAbstraction took 677583.98ms. Allocated memory was 264.2MB in the beginning and 4.0GB in the end (delta: 3.7GB). Free memory was 226.3MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2023-12-25 07:34:23,136 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.18ms. Allocated memory is still 173.0MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 364.65ms. Allocated memory is still 264.2MB. Free memory was 212.2MB in the beginning and 195.0MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.15ms. Allocated memory is still 264.2MB. Free memory was 195.0MB in the beginning and 192.3MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 61.61ms. Allocated memory is still 264.2MB. Free memory was 192.3MB in the beginning and 188.7MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 652.08ms. Allocated memory is still 264.2MB. Free memory was 188.7MB in the beginning and 227.3MB in the end (delta: -38.6MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 677583.98ms. Allocated memory was 264.2MB in the beginning and 4.0GB in the end (delta: 3.7GB). Free memory was 226.3MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 2.2GB. 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: 533]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] msg_t nomsg = (msg_t )-1; [L24] port_t g1v ; [L25] int8_t g1v_old ; [L26] int8_t g1v_new ; [L27] port_t g2v ; [L28] int8_t g2v_old ; [L29] int8_t g2v_new ; [L30] port_t g3v ; [L31] int8_t g3v_old ; [L32] int8_t g3v_new ; [L39] _Bool gate1Failed ; [L40] _Bool gate2Failed ; [L41] _Bool gate3Failed ; [L42] msg_t VALUE1 ; [L43] msg_t VALUE2 ; [L44] msg_t VALUE3 ; [L46] _Bool gate1Failed_History_0 ; [L47] _Bool gate1Failed_History_1 ; [L48] _Bool gate1Failed_History_2 ; [L49] _Bool gate2Failed_History_0 ; [L50] _Bool gate2Failed_History_1 ; [L51] _Bool gate2Failed_History_2 ; [L52] _Bool gate3Failed_History_0 ; [L53] _Bool gate3Failed_History_1 ; [L54] _Bool gate3Failed_History_2 ; [L55] int8_t votedValue_History_0 ; [L56] int8_t votedValue_History_1 ; [L57] int8_t votedValue_History_2 ; [L475] int c1 ; [L476] int i2 ; [L479] c1 = 0 [L480] gate1Failed = __VERIFIER_nondet_bool() [L481] gate2Failed = __VERIFIER_nondet_bool() [L482] gate3Failed = __VERIFIER_nondet_bool() [L483] VALUE1 = __VERIFIER_nondet_char() [L484] VALUE2 = __VERIFIER_nondet_char() [L485] VALUE3 = __VERIFIER_nondet_char() [L486] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L487] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L488] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L489] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L490] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L491] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L492] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L493] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L494] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L495] votedValue_History_0 = __VERIFIER_nondet_char() [L496] votedValue_History_1 = __VERIFIER_nondet_char() [L497] votedValue_History_2 = __VERIFIER_nondet_char() [L498] CALL, EXPR init() [L206] int tmp ; [L207] int tmp___0 ; [L208] int tmp___1 ; [L209] int tmp___2 ; VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1] [L212] CALL, EXPR add_history_type(0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0] [L74] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0] [L75] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0] [L76] CALL, EXPR read_history_bool(0, 0) VAL [\old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1] [L129] COND TRUE history_id == 0 VAL [\old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, historyIndex=0, history_id=0, nomsg=-1] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_0); VAL [\old(historyIndex)=0, \old(history_id)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, historyIndex=0, history_id=0, nomsg=-1] [L76] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=0] [L99] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=1] [L74] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=1] [L75] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=1] [L76] CALL, EXPR read_history_bool(0, 0) VAL [\old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1] [L129] COND TRUE history_id == 0 VAL [\old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, historyIndex=0, history_id=0, nomsg=-1] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_0); VAL [\old(historyIndex)=0, \old(history_id)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, historyIndex=0, history_id=0, nomsg=-1] [L76] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=1] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=1] [L99] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=2] [L74] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=2] [L75] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=2] [L76] CALL, EXPR read_history_bool(0, 0) VAL [\old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1] [L129] COND TRUE history_id == 0 VAL [\old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, historyIndex=0, history_id=0, nomsg=-1] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_0); VAL [\old(historyIndex)=0, \old(history_id)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, historyIndex=0, history_id=0, nomsg=-1] [L76] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=2] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=2] [L99] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=3] [L74] COND FALSE !(var < 3) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=3] [L101] return (1); VAL [\old(history_id)=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=3] [L212] RET, EXPR add_history_type(0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1] [L212] tmp = add_history_type(0) [L213] COND FALSE !(! tmp) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, tmp=1] [L216] CALL, EXPR add_history_type(1) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0] [L74] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0] [L75] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0] [L81] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0] [L82] CALL, EXPR read_history_bool(1, 0) VAL [\old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1] [L129] COND FALSE !(history_id == 0) VAL [\old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1] [L139] COND TRUE history_id == 1 VAL [\old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_0); VAL [\old(historyIndex)=0, \old(history_id)=1, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1] [L82] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=0] [L99] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1] [L74] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1] [L75] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1] [L81] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1] [L82] CALL, EXPR read_history_bool(1, 0) VAL [\old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1] [L129] COND FALSE !(history_id == 0) VAL [\old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1] [L139] COND TRUE history_id == 1 VAL [\old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_0); VAL [\old(historyIndex)=0, \old(history_id)=1, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1] [L82] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1] [L99] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2] [L74] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2] [L75] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2] [L81] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2] [L82] CALL, EXPR read_history_bool(1, 0) VAL [\old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1] [L129] COND FALSE !(history_id == 0) VAL [\old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1] [L139] COND TRUE history_id == 1 VAL [\old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_0); VAL [\old(historyIndex)=0, \old(history_id)=1, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1] [L82] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2] [L99] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=3] [L74] COND FALSE !(var < 3) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=3] [L101] return (1); VAL [\old(history_id)=1, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=3] [L216] RET, EXPR add_history_type(1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, tmp=1] [L216] tmp___0 = add_history_type(1) [L217] COND FALSE !(! tmp___0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1] [L220] CALL, EXPR add_history_type(2) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0] [L74] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0] [L75] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0] [L81] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0] [L87] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0] [L88] CALL, EXPR read_history_bool(2, 0) VAL [\old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1] [L129] COND FALSE !(history_id == 0) VAL [\old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1] [L139] COND FALSE !(history_id == 1) VAL [\old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1] [L149] COND TRUE history_id == 2 VAL [\old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_0); VAL [\old(historyIndex)=0, \old(history_id)=2, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1] [L88] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=0] [L99] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1] [L74] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1] [L75] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1] [L81] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1] [L87] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1] [L88] CALL, EXPR read_history_bool(2, 0) VAL [\old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1] [L129] COND FALSE !(history_id == 0) VAL [\old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1] [L139] COND FALSE !(history_id == 1) VAL [\old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1] [L149] COND TRUE history_id == 2 VAL [\old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_0); VAL [\old(historyIndex)=0, \old(history_id)=2, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1] [L88] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1] [L99] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2] [L74] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2] [L75] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2] [L81] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2] [L87] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2] [L88] CALL, EXPR read_history_bool(2, 0) VAL [\old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1] [L129] COND FALSE !(history_id == 0) VAL [\old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1] [L139] COND FALSE !(history_id == 1) VAL [\old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1] [L149] COND TRUE history_id == 2 VAL [\old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_0); VAL [\old(historyIndex)=0, \old(history_id)=2, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1] [L88] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2] [L99] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=3] [L74] COND FALSE !(var < 3) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=3] [L101] return (1); VAL [\old(history_id)=2, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=3] [L220] RET, EXPR add_history_type(2) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1] [L220] tmp___1 = add_history_type(2) [L221] COND FALSE !(! tmp___1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1] [L224] CALL, EXPR add_history_type(3) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0] [L74] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0] [L75] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0] [L81] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0] [L87] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0] [L93] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0] [L94] CALL, EXPR read_history_int8(3, 0) VAL [\old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1] [L109] COND TRUE history_id == 3 VAL [\old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=3, nomsg=-1] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [\old(historyIndex)=0, \old(history_id)=3, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-2] [L94] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=0, votedValue_History_0=-2] [L99] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2] [L74] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2] [L75] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2] [L81] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2] [L87] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2] [L93] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2] [L94] CALL, EXPR read_history_int8(3, 0) VAL [\old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, votedValue_History_0=-2] [L109] COND TRUE history_id == 3 VAL [\old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-2] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [\old(historyIndex)=0, \old(history_id)=3, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-2] [L94] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2] [L99] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2] [L74] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2] [L75] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2] [L81] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2] [L87] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2] [L93] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2] [L94] CALL, EXPR read_history_int8(3, 0) VAL [\old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, votedValue_History_0=-2] [L109] COND TRUE history_id == 3 VAL [\old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-2] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [\old(historyIndex)=0, \old(history_id)=3, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-2] [L94] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2] [L99] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=3, votedValue_History_0=-2] [L74] COND FALSE !(var < 3) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=3, votedValue_History_0=-2] [L101] return (1); VAL [\old(history_id)=3, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=3, votedValue_History_0=-2] [L224] RET, EXPR add_history_type(3) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, votedValue_History_0=-2] [L224] tmp___2 = add_history_type(3) [L225] COND FALSE !(! tmp___2) [L228] return (1); VAL [\result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, votedValue_History_0=-2] [L498] RET, EXPR init() [L498] i2 = init() [L499] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, votedValue_History_0=-2] [L37] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, votedValue_History_0=-2] [L499] RET assume_abort_if_not(i2) VAL [c1=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, i2=1, nomsg=-1, votedValue_History_0=-2] [L500] g1v_old = nomsg [L501] g1v_new = nomsg [L502] g2v_old = nomsg [L503] g2v_new = nomsg [L504] g3v_old = nomsg [L505] g3v_new = nomsg [L506] i2 = 0 VAL [c1=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, i2=0, nomsg=-1, votedValue_History_0=-2] [L507] COND TRUE 1 [L509] CALL gate1_each_pals_period() [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [L347] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=8, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=7, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=2, \old(gate3Failed_History_2)=6, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=8, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=7, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=2, gate3Failed_History_2=6, nomsg=-1, votedValue_History_0=-2] [L184] COND TRUE history_id == 0 [L185] gate1Failed_History_2 = gate1Failed_History_1 [L186] gate1Failed_History_1 = gate1Failed_History_0 [L187] gate1Failed_History_0 = buf VAL [\old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=8, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=7, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=2, \old(gate3Failed_History_2)=6, \old(history_id)=0, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed_History_0=0, gate2Failed_History_1=7, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=2, gate3Failed_History_2=6, history_id=0, nomsg=-1, votedValue_History_0=-2] [L347] RET write_history_bool(0, gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed_History_0=0, gate2Failed_History_1=7, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=2, gate3Failed_History_2=6, nomsg=-1, votedValue_History_0=-2] [L348] COND FALSE !(\read(gate1Failed)) [L352] tmp = __VERIFIER_nondet_char() [L353] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed_History_0=0, gate2Failed_History_1=7, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=2, gate3Failed_History_2=6, next_state=1, nomsg=-1, tmp=1, votedValue_History_0=-2] [L354] COND FALSE !((int )next_state == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed_History_0=0, gate2Failed_History_1=7, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=2, gate3Failed_History_2=6, next_state=1, nomsg=-1, tmp=1, votedValue_History_0=-2] [L357] COND TRUE (int )next_state == 1 [L358] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed_History_0=0, gate2Failed_History_1=7, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=2, gate3Failed_History_2=6, next_state=1, nomsg=-1, tmp=1, tmp___0=1, votedValue_History_0=-2] [L365] CALL assume_abort_if_not((_Bool )tmp___0) VAL [\old(cond)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed_History_0=0, gate2Failed_History_1=7, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=2, gate3Failed_History_2=6, nomsg=-1, votedValue_History_0=-2] [L37] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed_History_0=0, gate2Failed_History_1=7, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=2, gate3Failed_History_2=6, nomsg=-1, votedValue_History_0=-2] [L365] RET assume_abort_if_not((_Bool )tmp___0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed_History_0=0, gate2Failed_History_1=7, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=2, gate3Failed_History_2=6, next_state=1, nomsg=-1, tmp=1, tmp___0=1, votedValue_History_0=-2] [L366] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed_History_0=0, gate2Failed_History_1=7, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=2, gate3Failed_History_2=6, next_state=1, nomsg=-1, tmp=1, tmp___0=1, votedValue_History_0=-2] [L509] RET gate1_each_pals_period() [L510] CALL gate2_each_pals_period() [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L378] CALL write_history_bool(1, gate2Failed) VAL [\old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=8, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=7, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=2, \old(gate3Failed_History_2)=6, \old(history_id)=1, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=7, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=2, gate3Failed_History_2=6, nomsg=-1, votedValue_History_0=-2] [L184] COND FALSE !(history_id == 0) VAL [\old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=8, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=7, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=2, \old(gate3Failed_History_2)=6, \old(history_id)=1, buf=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=7, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=2, gate3Failed_History_2=6, history_id=1, nomsg=-1, votedValue_History_0=-2] [L189] COND TRUE history_id == 1 [L190] gate2Failed_History_2 = gate2Failed_History_1 [L191] gate2Failed_History_1 = gate2Failed_History_0 [L192] gate2Failed_History_0 = buf VAL [\old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=8, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=7, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=2, \old(gate3Failed_History_2)=6, \old(history_id)=1, buf=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=2, gate3Failed_History_2=6, history_id=1, nomsg=-1, votedValue_History_0=-2] [L378] RET write_history_bool(1, gate2Failed) VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=2, gate3Failed_History_2=6, nomsg=-1, votedValue_History_0=-2] [L379] COND FALSE !(\read(gate2Failed)) [L383] tmp = __VERIFIER_nondet_char() [L384] next_state = tmp VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=2, gate3Failed_History_2=6, next_state=0, nomsg=-1, tmp=0, votedValue_History_0=-2] [L385] COND TRUE (int )next_state == 0 [L386] tmp___0 = 1 VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=2, gate3Failed_History_2=6, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-2] [L396] CALL assume_abort_if_not((_Bool )tmp___0) VAL [\old(cond)=1, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=2, gate3Failed_History_2=6, nomsg=-1, votedValue_History_0=-2] [L37] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=2, gate3Failed_History_2=6, nomsg=-1, votedValue_History_0=-2] [L396] RET assume_abort_if_not((_Bool )tmp___0) VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=2, gate3Failed_History_2=6, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-2] [L397] g2v_new = next_state != nomsg && g2v_new == nomsg ? next_state : g2v_new VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=2, gate3Failed_History_2=6, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-2] [L510] RET gate2_each_pals_period() [L511] CALL gate3_each_pals_period() [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L409] CALL write_history_bool(2, gate3Failed) VAL [\old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=8, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=2, \old(gate3Failed_History_2)=6, \old(history_id)=2, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=2, gate3Failed_History_2=6, nomsg=-1, votedValue_History_0=-2] [L184] COND FALSE !(history_id == 0) VAL [\old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=8, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=2, \old(gate3Failed_History_2)=6, \old(history_id)=2, buf=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=2, gate3Failed_History_2=6, history_id=2, nomsg=-1, votedValue_History_0=-2] [L189] COND FALSE !(history_id == 1) VAL [\old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=8, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=2, \old(gate3Failed_History_2)=6, \old(history_id)=2, buf=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=2, gate3Failed_History_2=6, history_id=2, nomsg=-1, votedValue_History_0=-2] [L194] COND TRUE history_id == 2 [L195] gate3Failed_History_2 = gate3Failed_History_1 [L196] gate3Failed_History_1 = gate3Failed_History_0 [L197] gate3Failed_History_0 = buf VAL [\old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=8, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=2, \old(gate3Failed_History_2)=6, \old(history_id)=2, buf=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, history_id=2, nomsg=-1, votedValue_History_0=-2] [L409] RET write_history_bool(2, gate3Failed) VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-2] [L410] COND FALSE !(\read(gate3Failed)) [L414] tmp = __VERIFIER_nondet_char() [L415] next_state = tmp VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, next_state=0, nomsg=-1, tmp=0, votedValue_History_0=-2] [L416] COND TRUE (int )next_state == 0 [L417] tmp___0 = 1 VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-2] [L427] CALL assume_abort_if_not((_Bool )tmp___0) VAL [\old(cond)=1, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-2] [L37] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-2] [L427] RET assume_abort_if_not((_Bool )tmp___0) VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-2] [L428] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-2] [L511] RET gate3_each_pals_period() [L512] CALL voter() [L434] int8_t voted_value ; [L437] voted_value = nomsg [L438] VALUE1 = g1v_old [L439] g1v_old = nomsg [L440] VALUE2 = g2v_old [L441] g2v_old = nomsg [L442] VALUE3 = g3v_old [L443] g3v_old = nomsg VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-2, voted_value=-1] [L444] COND TRUE (int )VALUE1 == (int )VALUE2 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-2, voted_value=-1] [L445] COND TRUE (int )VALUE1 == (int )nomsg [L446] voted_value = VALUE3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-2, voted_value=-1] [L469] CALL write_history_int8(3, voted_value) [L169] COND TRUE history_id == 3 [L170] votedValue_History_2 = votedValue_History_1 [L171] votedValue_History_1 = votedValue_History_0 [L172] votedValue_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=-1, \old(history_id)=3, buf=-1, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L469] RET write_history_int8(3, voted_value) [L512] RET voter() [L513] g1v_old = g1v_new [L514] g1v_new = nomsg [L515] g2v_old = g2v_new [L516] g2v_new = nomsg [L517] g3v_old = g3v_new [L518] g3v_new = nomsg [L519] CALL, EXPR check() [L233] int tmp ; [L234] int temp_count ; [L235] int8_t tmp___0 ; [L236] int8_t tmp___1 ; [L237] int8_t tmp___2 ; [L238] _Bool tmp___3 ; [L239] _Bool tmp___4 ; [L240] _Bool tmp___5 ; [L241] int8_t tmp___6 ; [L242] _Bool tmp___7 ; [L243] _Bool tmp___8 ; [L244] _Bool tmp___9 ; [L245] int8_t tmp___10 ; [L246] int8_t tmp___11 ; [L247] int8_t tmp___12 ; [L248] int8_t tmp___13 ; [L249] int8_t tmp___14 ; VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L252] COND TRUE ! gate1Failed [L253] tmp = 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L263] CALL assume_abort_if_not((_Bool )tmp) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(cond)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L37] COND FALSE !(!cond) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(cond)=1, cond=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L263] RET assume_abort_if_not((_Bool )tmp) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L264] CALL, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L129] COND TRUE history_id == 0 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L130] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L264] RET, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L264] tmp___3 = read_history_bool(0, 1) [L265] COND TRUE ! tmp___3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, tmp=1, tmp___3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L266] CALL, EXPR read_history_bool(1, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L139] COND TRUE history_id == 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L140] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L143] COND TRUE historyIndex == 1 [L144] return (gate2Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L266] RET, EXPR read_history_bool(1, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, tmp=1, tmp___3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L266] tmp___4 = read_history_bool(1, 1) [L267] COND TRUE ! tmp___4 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, tmp=1, tmp___3=0, tmp___4=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L268] CALL, EXPR read_history_bool(2, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L139] COND FALSE !(history_id == 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L149] COND TRUE history_id == 2 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L150] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L153] COND TRUE historyIndex == 1 [L154] return (gate3Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, \result=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L268] RET, EXPR read_history_bool(2, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, tmp=1, tmp___3=0, tmp___4=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L268] tmp___5 = read_history_bool(2, 1) [L269] COND TRUE ! tmp___5 [L270] temp_count = 0 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L271] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L271] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L271] tmp___0 = read_history_int8(3, 0) [L272] COND TRUE (int )VALUE1 == (int )tmp___0 [L273] temp_count ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L275] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L275] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L275] tmp___1 = read_history_int8(3, 0) [L276] COND TRUE (int )VALUE2 == (int )tmp___1 [L277] temp_count ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L279] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L279] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L279] tmp___2 = read_history_int8(3, 0) [L280] COND TRUE (int )VALUE3 == (int )tmp___2 [L281] temp_count ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L283] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L297] COND FALSE !(! (temp_count > 1)) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L303] CALL, EXPR read_history_int8(3, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, historyIndex=1, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L110] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, historyIndex=1, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L113] COND TRUE historyIndex == 1 [L114] return (votedValue_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=3, \result=-2, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, historyIndex=1, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L303] RET, EXPR read_history_int8(3, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L303] tmp___10 = read_history_int8(3, 1) [L304] COND FALSE !((int )tmp___10 > -2) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___10=-2, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L323] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L323] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___10=-2, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L323] tmp___11 = read_history_int8(3, 0) [L324] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___10=-2, tmp___11=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L336] return (1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \result=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___10=-2, tmp___11=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L519] RET, EXPR check() [L519] c1 = check() [L520] CALL assert(c1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(arg)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L531] COND FALSE !(! arg) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(arg)=1, arg=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L520] RET assert(c1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, c1=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, i2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L507] COND TRUE 1 [L509] CALL gate1_each_pals_period() [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [L347] CALL write_history_bool(0, gate1Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=8, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=2, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=8, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L184] COND TRUE history_id == 0 [L185] gate1Failed_History_2 = gate1Failed_History_1 [L186] gate1Failed_History_1 = gate1Failed_History_0 [L187] gate1Failed_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=8, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=2, \old(history_id)=0, buf=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L347] RET write_history_bool(0, gate1Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L348] COND FALSE !(\read(gate1Failed)) [L352] tmp = __VERIFIER_nondet_char() [L353] next_state = tmp VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, next_state=0, nomsg=-1, tmp=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L354] COND TRUE (int )next_state == 0 [L355] tmp___0 = 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L365] CALL assume_abort_if_not((_Bool )tmp___0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(cond)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L37] COND FALSE !(!cond) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(cond)=1, cond=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L365] RET assume_abort_if_not((_Bool )tmp___0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L366] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L509] RET gate1_each_pals_period() [L510] CALL gate2_each_pals_period() [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L378] CALL write_history_bool(1, gate2Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=128, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=2, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L184] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=128, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=2, \old(history_id)=1, buf=128, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=7, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L189] COND TRUE history_id == 1 [L190] gate2Failed_History_2 = gate2Failed_History_1 [L191] gate2Failed_History_1 = gate2Failed_History_0 [L192] gate2Failed_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=128, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=2, \old(history_id)=1, buf=128, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L378] RET write_history_bool(1, gate2Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L379] COND TRUE \read(gate2Failed) [L380] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L510] RET gate2_each_pals_period() [L511] CALL gate3_each_pals_period() [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L409] CALL write_history_bool(2, gate3Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=128, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=128, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=2, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L184] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=128, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=128, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=2, \old(history_id)=2, buf=128, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L189] COND FALSE !(history_id == 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=128, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=128, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=2, \old(history_id)=2, buf=128, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=2, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L194] COND TRUE history_id == 2 [L195] gate3Failed_History_2 = gate3Failed_History_1 [L196] gate3Failed_History_1 = gate3Failed_History_0 [L197] gate3Failed_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=128, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=128, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=2, \old(history_id)=2, buf=128, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L409] RET write_history_bool(2, gate3Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L410] COND TRUE \read(gate3Failed) [L411] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3] [L511] RET gate3_each_pals_period() [L512] CALL voter() [L434] int8_t voted_value ; [L437] voted_value = nomsg [L438] VALUE1 = g1v_old [L439] g1v_old = nomsg [L440] VALUE2 = g2v_old [L441] g2v_old = nomsg [L442] VALUE3 = g3v_old [L443] g3v_old = nomsg VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3, voted_value=-1] [L444] COND FALSE !((int )VALUE1 == (int )VALUE2) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3, voted_value=-1] [L451] COND FALSE !((int )VALUE1 == (int )VALUE3) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3, voted_value=-1] [L458] COND TRUE (int )VALUE1 != (int )nomsg [L459] voted_value = VALUE1 VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=3, voted_value=1] [L469] CALL write_history_int8(3, voted_value) [L169] COND TRUE history_id == 3 [L170] votedValue_History_2 = votedValue_History_1 [L171] votedValue_History_1 = votedValue_History_0 [L172] votedValue_History_0 = buf VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(buf)=1, \old(history_id)=3, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L469] RET write_history_int8(3, voted_value) [L512] RET voter() [L513] g1v_old = g1v_new [L514] g1v_new = nomsg [L515] g2v_old = g2v_new [L516] g2v_new = nomsg [L517] g3v_old = g3v_new [L518] g3v_new = nomsg [L519] CALL, EXPR check() [L233] int tmp ; [L234] int temp_count ; [L235] int8_t tmp___0 ; [L236] int8_t tmp___1 ; [L237] int8_t tmp___2 ; [L238] _Bool tmp___3 ; [L239] _Bool tmp___4 ; [L240] _Bool tmp___5 ; [L241] int8_t tmp___6 ; [L242] _Bool tmp___7 ; [L243] _Bool tmp___8 ; [L244] _Bool tmp___9 ; [L245] int8_t tmp___10 ; [L246] int8_t tmp___11 ; [L247] int8_t tmp___12 ; [L248] int8_t tmp___13 ; [L249] int8_t tmp___14 ; VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L252] COND TRUE ! gate1Failed [L253] tmp = 1 VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L263] CALL assume_abort_if_not((_Bool )tmp) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(cond)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L37] COND FALSE !(!cond) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(cond)=1, cond=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L263] RET assume_abort_if_not((_Bool )tmp) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L264] CALL, EXPR read_history_bool(0, 1) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L129] COND TRUE history_id == 0 VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND FALSE !(historyIndex == 0) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_1); VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L264] RET, EXPR read_history_bool(0, 1) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L264] tmp___3 = read_history_bool(0, 1) [L265] COND TRUE ! tmp___3 VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L266] CALL, EXPR read_history_bool(1, 1) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L139] COND TRUE history_id == 1 VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L140] COND FALSE !(historyIndex == 0) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L143] COND TRUE historyIndex == 1 [L144] return (gate2Failed_History_1); VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L266] RET, EXPR read_history_bool(1, 1) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L266] tmp___4 = read_history_bool(1, 1) [L267] COND TRUE ! tmp___4 VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=0, tmp___4=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L268] CALL, EXPR read_history_bool(2, 1) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L139] COND FALSE !(history_id == 1) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L149] COND TRUE history_id == 2 VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L150] COND FALSE !(historyIndex == 0) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L153] COND TRUE historyIndex == 1 [L154] return (gate3Failed_History_1); VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L268] RET, EXPR read_history_bool(2, 1) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=0, tmp___4=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L268] tmp___5 = read_history_bool(2, 1) [L269] COND TRUE ! tmp___5 [L270] temp_count = 0 VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L271] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L109] COND TRUE history_id == 3 VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, \result=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L271] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L271] tmp___0 = read_history_int8(3, 0) [L272] COND TRUE (int )VALUE1 == (int )tmp___0 [L273] temp_count ++ VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L275] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L109] COND TRUE history_id == 3 VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, \result=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L275] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L275] tmp___1 = read_history_int8(3, 0) [L276] COND FALSE !((int )VALUE2 == (int )tmp___1) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L279] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L109] COND TRUE history_id == 3 VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, \result=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L279] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L279] tmp___2 = read_history_int8(3, 0) [L280] COND FALSE !((int )VALUE3 == (int )tmp___2) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L283] COND TRUE (int )VALUE1 != (int )VALUE2 VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L284] COND TRUE (int )VALUE1 != (int )VALUE3 VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L285] COND FALSE !((int )VALUE2 != (int )VALUE3) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L297] COND TRUE ! (temp_count > 1) [L298] return (0); VAL [VALUE1=1, VALUE2=0, VALUE3=0, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L519] RET, EXPR check() [L519] c1 = check() [L520] CALL assert(c1) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(arg)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L531] COND TRUE ! arg VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(arg)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L533] reach_error() VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(arg)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=128, gate2Failed_History_0=128, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=128, gate3Failed_History_0=128, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 173 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 677.4s, OverallIterations: 66, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.5s, AutomataDifference: 460.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42323 SdHoareTripleChecker+Valid, 60.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42053 mSDsluCounter, 224782 SdHoareTripleChecker+Invalid, 51.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 194963 mSDsCounter, 12601 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111898 IncrementalHoareTripleChecker+Invalid, 124499 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12601 mSolverCounterUnsat, 29819 mSDtfsCounter, 111898 mSolverCounterSat, 1.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33383 GetRequests, 30542 SyntacticMatches, 20 SemanticMatches, 2821 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180682 ImplicationChecksByTransitivity, 55.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40544occurred in iteration=65, InterpolantAutomatonStates: 2529, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 162.4s AutomataMinimizationTime, 65 MinimizatonAttempts, 447831 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.1s SsaConstructionTime, 6.8s SatisfiabilityAnalysisTime, 27.7s InterpolantComputationTime, 19125 NumberOfCodeBlocks, 19084 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 30174 ConstructedInterpolants, 0 QuantifiedInterpolants, 97711 SizeOfPredicates, 198 NumberOfNonLiveVariables, 34675 ConjunctsInSsa, 537 ConjunctsInUnsatCore, 97 InterpolantComputations, 35 PerfectInterpolantSequences, 74329/83768 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:34:23,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...