/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_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 00:49:49,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 00:49:49,839 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 00:49:49,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 00:49:49,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 00:49:49,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 00:49:49,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 00:49:49,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 00:49:49,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 00:49:49,869 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 00:49:49,870 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 00:49:49,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 00:49:49,871 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 00:49:49,872 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 00:49:49,872 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 00:49:49,872 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 00:49:49,872 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 00:49:49,872 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 00:49:49,872 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 00:49:49,872 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 00:49:49,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 00:49:49,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 00:49:49,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 00:49:49,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 00:49:49,873 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 00:49:49,874 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 00:49:49,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 00:49:49,874 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 00:49:49,874 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 00:49:49,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 00:49:49,875 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 00:49:49,875 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 00:49:49,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 00:49:49,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 00:49:49,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 00:49:49,876 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 00:49:49,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 00:49:49,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 00:49:49,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 00:49:49,876 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 00:49:49,876 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 00:49:49,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 00:49:49,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 00:49:49,877 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-20 00:49:50,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 00:49:50,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 00:49:50,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 00:49:50,053 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 00:49:50,053 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 00:49:50,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2023-12-20 00:49:51,174 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 00:49:51,440 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 00:49:51,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2023-12-20 00:49:51,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8179c324/f21caf2fcdbc4aaea5c1bec58a2e6ac7/FLAG1276a69e9 [2023-12-20 00:49:51,468 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8179c324/f21caf2fcdbc4aaea5c1bec58a2e6ac7 [2023-12-20 00:49:51,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 00:49:51,471 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 00:49:51,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 00:49:51,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 00:49:51,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 00:49:51,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 12:49:51" (1/1) ... [2023-12-20 00:49:51,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75c4d3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:49:51, skipping insertion in model container [2023-12-20 00:49:51,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 12:49:51" (1/1) ... [2023-12-20 00:49:51,525 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 00:49:51,692 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.1.ufo.BOUNDED-10.pals.c[11956,11969] [2023-12-20 00:49:51,695 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 00:49:51,702 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 00:49:51,742 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.1.ufo.BOUNDED-10.pals.c[11956,11969] [2023-12-20 00:49:51,743 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 00:49:51,754 INFO L206 MainTranslator]: Completed translation [2023-12-20 00:49:51,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:49:51 WrapperNode [2023-12-20 00:49:51,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 00:49:51,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 00:49:51,756 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 00:49:51,756 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 00:49:51,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:49:51" (1/1) ... [2023-12-20 00:49:51,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:49:51" (1/1) ... [2023-12-20 00:49:51,800 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 412 [2023-12-20 00:49:51,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 00:49:51,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 00:49:51,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 00:49:51,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 00:49:51,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:49:51" (1/1) ... [2023-12-20 00:49:51,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:49:51" (1/1) ... [2023-12-20 00:49:51,819 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:49:51" (1/1) ... [2023-12-20 00:49:51,841 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-20 00:49:51,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:49:51" (1/1) ... [2023-12-20 00:49:51,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:49:51" (1/1) ... [2023-12-20 00:49:51,848 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:49:51" (1/1) ... [2023-12-20 00:49:51,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:49:51" (1/1) ... [2023-12-20 00:49:51,871 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:49:51" (1/1) ... [2023-12-20 00:49:51,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:49:51" (1/1) ... [2023-12-20 00:49:51,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 00:49:51,876 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 00:49:51,876 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 00:49:51,876 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 00:49:51,877 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:49:51" (1/1) ... [2023-12-20 00:49:51,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 00:49:51,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:49:51,942 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-20 00:49:51,979 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-20 00:49:51,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 00:49:51,997 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2023-12-20 00:49:51,998 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2023-12-20 00:49:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2023-12-20 00:49:51,998 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2023-12-20 00:49:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2023-12-20 00:49:51,998 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2023-12-20 00:49:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2023-12-20 00:49:51,998 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2023-12-20 00:49:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2023-12-20 00:49:51,998 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2023-12-20 00:49:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 00:49:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 00:49:51,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 00:49:52,091 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 00:49:52,093 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 00:49:52,536 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 00:49:52,612 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 00:49:52,612 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-20 00:49:52,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 12:49:52 BoogieIcfgContainer [2023-12-20 00:49:52,613 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 00:49:52,615 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 00:49:52,615 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 00:49:52,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 00:49:52,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 12:49:51" (1/3) ... [2023-12-20 00:49:52,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9e6f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 12:49:52, skipping insertion in model container [2023-12-20 00:49:52,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:49:51" (2/3) ... [2023-12-20 00:49:52,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9e6f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 12:49:52, skipping insertion in model container [2023-12-20 00:49:52,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 12:49:52" (3/3) ... [2023-12-20 00:49:52,622 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2023-12-20 00:49:52,634 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 00:49:52,635 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 00:49:52,677 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 00:49:52,681 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;@64ba4acc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 00:49:52,682 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 00:49:52,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 132 states have (on average 1.621212121212121) internal successors, (214), 136 states have internal predecessors, (214), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-20 00:49:52,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-20 00:49:52,695 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:52,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:49:52,696 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:52,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:52,700 INFO L85 PathProgramCache]: Analyzing trace with hash -409509753, now seen corresponding path program 1 times [2023-12-20 00:49:52,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:52,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278280912] [2023-12-20 00:49:52,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:52,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:52,898 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-20 00:49:52,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:52,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278280912] [2023-12-20 00:49:52,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278280912] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:49:52,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:49:52,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:49:52,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641091129] [2023-12-20 00:49:52,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:52,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:49:52,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:52,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:49:52,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:49:52,932 INFO L87 Difference]: Start difference. First operand has 171 states, 132 states have (on average 1.621212121212121) internal successors, (214), 136 states have internal predecessors, (214), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) 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-20 00:49:53,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:53,058 INFO L93 Difference]: Finished difference Result 348 states and 600 transitions. [2023-12-20 00:49:53,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:49:53,060 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-20 00:49:53,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:53,070 INFO L225 Difference]: With dead ends: 348 [2023-12-20 00:49:53,070 INFO L226 Difference]: Without dead ends: 177 [2023-12-20 00:49:53,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-20 00:49:53,080 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 18 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:49:53,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 769 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:49:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-12-20 00:49:53,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2023-12-20 00:49:53,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 139 states have internal predecessors, (211), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-20 00:49:53,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 275 transitions. [2023-12-20 00:49:53,136 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 275 transitions. Word has length 14 [2023-12-20 00:49:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:53,137 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 275 transitions. [2023-12-20 00:49:53,137 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-20 00:49:53,137 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 275 transitions. [2023-12-20 00:49:53,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-20 00:49:53,139 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:53,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:49:53,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 00:49:53,140 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:53,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:53,141 INFO L85 PathProgramCache]: Analyzing trace with hash 247426362, now seen corresponding path program 1 times [2023-12-20 00:49:53,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:53,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106992957] [2023-12-20 00:49:53,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:53,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:53,198 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-20 00:49:53,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:53,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106992957] [2023-12-20 00:49:53,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106992957] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:49:53,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:49:53,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:49:53,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601052507] [2023-12-20 00:49:53,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:53,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:49:53,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:53,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:49:53,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:49:53,201 INFO L87 Difference]: Start difference. First operand 175 states and 275 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-20 00:49:53,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:53,249 INFO L93 Difference]: Finished difference Result 364 states and 574 transitions. [2023-12-20 00:49:53,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:49:53,249 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-20 00:49:53,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:53,251 INFO L225 Difference]: With dead ends: 364 [2023-12-20 00:49:53,251 INFO L226 Difference]: Without dead ends: 191 [2023-12-20 00:49:53,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-20 00:49:53,253 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 25 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 786 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-20 00:49:53,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 786 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:49:53,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-12-20 00:49:53,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2023-12-20 00:49:53,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 147 states have (on average 1.530612244897959) internal successors, (225), 150 states have internal predecessors, (225), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-20 00:49:53,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 291 transitions. [2023-12-20 00:49:53,265 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 291 transitions. Word has length 15 [2023-12-20 00:49:53,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:53,265 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 291 transitions. [2023-12-20 00:49:53,265 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-20 00:49:53,265 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 291 transitions. [2023-12-20 00:49:53,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-20 00:49:53,266 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:53,266 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] [2023-12-20 00:49:53,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 00:49:53,267 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:53,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:53,267 INFO L85 PathProgramCache]: Analyzing trace with hash 803678296, now seen corresponding path program 1 times [2023-12-20 00:49:53,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:53,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946651616] [2023-12-20 00:49:53,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:53,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:53,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:53,323 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-20 00:49:53,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:53,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946651616] [2023-12-20 00:49:53,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946651616] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:49:53,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:49:53,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 00:49:53,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306353000] [2023-12-20 00:49:53,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:53,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:49:53,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:53,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:49:53,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 00:49:53,326 INFO L87 Difference]: Start difference. First operand 188 states and 291 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-20 00:49:53,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:53,353 INFO L93 Difference]: Finished difference Result 396 states and 620 transitions. [2023-12-20 00:49:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:49:53,355 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-12-20 00:49:53,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:53,358 INFO L225 Difference]: With dead ends: 396 [2023-12-20 00:49:53,358 INFO L226 Difference]: Without dead ends: 217 [2023-12-20 00:49:53,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-20 00:49:53,360 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 22 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 532 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-20 00:49:53,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 532 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:49:53,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-12-20 00:49:53,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 190. [2023-12-20 00:49:53,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 149 states have (on average 1.523489932885906) internal successors, (227), 152 states have internal predecessors, (227), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-20 00:49:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 293 transitions. [2023-12-20 00:49:53,390 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 293 transitions. Word has length 22 [2023-12-20 00:49:53,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:53,390 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 293 transitions. [2023-12-20 00:49:53,390 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-20 00:49:53,390 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 293 transitions. [2023-12-20 00:49:53,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-20 00:49:53,392 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:53,392 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] [2023-12-20 00:49:53,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 00:49:53,392 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:53,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:53,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1522670071, now seen corresponding path program 1 times [2023-12-20 00:49:53,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:53,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120016608] [2023-12-20 00:49:53,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:53,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:53,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:53,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:53,471 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-20 00:49:53,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:53,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120016608] [2023-12-20 00:49:53,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120016608] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:49:53,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:49:53,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:49:53,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308313993] [2023-12-20 00:49:53,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:53,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:49:53,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:53,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:49:53,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:49:53,473 INFO L87 Difference]: Start difference. First operand 190 states and 293 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-20 00:49:53,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:53,518 INFO L93 Difference]: Finished difference Result 426 states and 674 transitions. [2023-12-20 00:49:53,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:49:53,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-12-20 00:49:53,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:53,520 INFO L225 Difference]: With dead ends: 426 [2023-12-20 00:49:53,520 INFO L226 Difference]: Without dead ends: 286 [2023-12-20 00:49:53,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-20 00:49:53,521 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 119 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:49:53,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 782 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:49:53,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-12-20 00:49:53,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 190. [2023-12-20 00:49:53,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 149 states have (on average 1.4966442953020134) internal successors, (223), 152 states have internal predecessors, (223), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-20 00:49:53,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 289 transitions. [2023-12-20 00:49:53,531 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 289 transitions. Word has length 30 [2023-12-20 00:49:53,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:53,532 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 289 transitions. [2023-12-20 00:49:53,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-20 00:49:53,536 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 289 transitions. [2023-12-20 00:49:53,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-20 00:49:53,537 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:53,537 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-20 00:49:53,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 00:49:53,537 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:53,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:53,538 INFO L85 PathProgramCache]: Analyzing trace with hash -114669019, now seen corresponding path program 1 times [2023-12-20 00:49:53,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:53,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463885234] [2023-12-20 00:49:53,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:53,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:53,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:53,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:53,642 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-20 00:49:53,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:53,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463885234] [2023-12-20 00:49:53,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463885234] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:49:53,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:49:53,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 00:49:53,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86678773] [2023-12-20 00:49:53,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:53,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:49:53,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:53,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:49:53,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 00:49:53,644 INFO L87 Difference]: Start difference. First operand 190 states and 289 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-20 00:49:53,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:53,683 INFO L93 Difference]: Finished difference Result 371 states and 568 transitions. [2023-12-20 00:49:53,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:49:53,684 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-20 00:49:53,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:53,686 INFO L225 Difference]: With dead ends: 371 [2023-12-20 00:49:53,686 INFO L226 Difference]: Without dead ends: 192 [2023-12-20 00:49:53,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-20 00:49:53,691 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1040 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-20 00:49:53,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1040 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:49:53,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-12-20 00:49:53,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2023-12-20 00:49:53,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 149 states have (on average 1.4899328859060403) internal successors, (222), 152 states have internal predecessors, (222), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-20 00:49:53,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 288 transitions. [2023-12-20 00:49:53,711 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 288 transitions. Word has length 31 [2023-12-20 00:49:53,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:53,711 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 288 transitions. [2023-12-20 00:49:53,711 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-20 00:49:53,711 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 288 transitions. [2023-12-20 00:49:53,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-20 00:49:53,715 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:53,716 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-20 00:49:53,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 00:49:53,716 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:53,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:53,717 INFO L85 PathProgramCache]: Analyzing trace with hash -793075601, now seen corresponding path program 1 times [2023-12-20 00:49:53,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:53,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949512850] [2023-12-20 00:49:53,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:53,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:53,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:53,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:53,790 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-20 00:49:53,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:53,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949512850] [2023-12-20 00:49:53,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949512850] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:49:53,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047699781] [2023-12-20 00:49:53,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:53,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:49:53,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:49:53,797 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:49:53,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 00:49:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:53,909 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 00:49:53,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:49:53,952 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-20 00:49:53,952 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 00:49:53,997 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-20 00:49:53,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047699781] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 00:49:53,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 00:49:53,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-12-20 00:49:53,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943727465] [2023-12-20 00:49:53,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 00:49:53,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:49:54,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:54,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:49:54,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-20 00:49:54,003 INFO L87 Difference]: Start difference. First operand 190 states and 288 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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-20 00:49:54,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:54,046 INFO L93 Difference]: Finished difference Result 429 states and 664 transitions. [2023-12-20 00:49:54,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:49:54,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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-20 00:49:54,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:54,050 INFO L225 Difference]: With dead ends: 429 [2023-12-20 00:49:54,050 INFO L226 Difference]: Without dead ends: 249 [2023-12-20 00:49:54,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-20 00:49:54,054 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 76 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:49:54,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 771 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:49:54,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-12-20 00:49:54,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 243. [2023-12-20 00:49:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 192 states have (on average 1.4635416666666667) internal successors, (281), 195 states have internal predecessors, (281), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2023-12-20 00:49:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 367 transitions. [2023-12-20 00:49:54,080 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 367 transitions. Word has length 34 [2023-12-20 00:49:54,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:54,080 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 367 transitions. [2023-12-20 00:49:54,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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-20 00:49:54,080 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 367 transitions. [2023-12-20 00:49:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-20 00:49:54,081 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:54,081 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-20 00:49:54,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-20 00:49:54,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-20 00:49:54,287 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:54,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:54,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2086166001, now seen corresponding path program 2 times [2023-12-20 00:49:54,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:54,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611119971] [2023-12-20 00:49:54,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:54,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:49:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:49:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,366 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-20 00:49:54,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:54,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611119971] [2023-12-20 00:49:54,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611119971] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:49:54,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:49:54,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:49:54,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102287207] [2023-12-20 00:49:54,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:54,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:49:54,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:54,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:49:54,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:49:54,370 INFO L87 Difference]: Start difference. First operand 243 states and 367 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-20 00:49:54,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:54,411 INFO L93 Difference]: Finished difference Result 467 states and 725 transitions. [2023-12-20 00:49:54,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:49:54,411 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-20 00:49:54,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:54,414 INFO L225 Difference]: With dead ends: 467 [2023-12-20 00:49:54,414 INFO L226 Difference]: Without dead ends: 252 [2023-12-20 00:49:54,415 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-20 00:49:54,416 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 19 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 765 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-20 00:49:54,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 765 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:49:54,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-12-20 00:49:54,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2023-12-20 00:49:54,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 198 states have (on average 1.4595959595959596) internal successors, (289), 201 states have internal predecessors, (289), 43 states have call successors, (43), 8 states have call predecessors, (43), 8 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2023-12-20 00:49:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2023-12-20 00:49:54,431 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 56 [2023-12-20 00:49:54,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:54,432 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2023-12-20 00:49:54,432 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-20 00:49:54,432 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2023-12-20 00:49:54,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-20 00:49:54,433 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:54,433 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-20 00:49:54,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 00:49:54,433 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:54,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:54,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2063557726, now seen corresponding path program 1 times [2023-12-20 00:49:54,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:54,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358207394] [2023-12-20 00:49:54,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:54,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:49:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:49:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,493 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-20 00:49:54,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:54,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358207394] [2023-12-20 00:49:54,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358207394] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:49:54,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:49:54,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:49:54,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562773211] [2023-12-20 00:49:54,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:54,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:49:54,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:54,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:49:54,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:49:54,496 INFO L87 Difference]: Start difference. First operand 250 states and 375 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-20 00:49:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:54,531 INFO L93 Difference]: Finished difference Result 511 states and 777 transitions. [2023-12-20 00:49:54,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:49:54,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-20 00:49:54,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:54,534 INFO L225 Difference]: With dead ends: 511 [2023-12-20 00:49:54,534 INFO L226 Difference]: Without dead ends: 289 [2023-12-20 00:49:54,535 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-20 00:49:54,535 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 24 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 778 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-20 00:49:54,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 778 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:49:54,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-12-20 00:49:54,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2023-12-20 00:49:54,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 230 states have (on average 1.4173913043478261) internal successors, (326), 233 states have internal predecessors, (326), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-20 00:49:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 418 transitions. [2023-12-20 00:49:54,548 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 418 transitions. Word has length 56 [2023-12-20 00:49:54,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:54,549 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 418 transitions. [2023-12-20 00:49:54,549 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-20 00:49:54,549 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 418 transitions. [2023-12-20 00:49:54,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-20 00:49:54,550 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:54,550 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-20 00:49:54,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 00:49:54,550 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:54,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:54,551 INFO L85 PathProgramCache]: Analyzing trace with hash 648603620, now seen corresponding path program 1 times [2023-12-20 00:49:54,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:54,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359016150] [2023-12-20 00:49:54,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:54,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:49:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:49:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:49:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:49:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,638 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-20 00:49:54,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:54,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359016150] [2023-12-20 00:49:54,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359016150] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:49:54,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:49:54,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 00:49:54,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719784699] [2023-12-20 00:49:54,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:54,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:49:54,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:54,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:49:54,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 00:49:54,641 INFO L87 Difference]: Start difference. First operand 286 states and 418 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-20 00:49:54,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:54,672 INFO L93 Difference]: Finished difference Result 522 states and 776 transitions. [2023-12-20 00:49:54,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:49:54,672 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-20 00:49:54,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:54,675 INFO L225 Difference]: With dead ends: 522 [2023-12-20 00:49:54,675 INFO L226 Difference]: Without dead ends: 288 [2023-12-20 00:49:54,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-20 00:49:54,678 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1039 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-20 00:49:54,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1039 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:49:54,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2023-12-20 00:49:54,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 286. [2023-12-20 00:49:54,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 230 states have (on average 1.4043478260869566) internal successors, (323), 233 states have internal predecessors, (323), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-20 00:49:54,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 415 transitions. [2023-12-20 00:49:54,688 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 415 transitions. Word has length 74 [2023-12-20 00:49:54,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:54,689 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 415 transitions. [2023-12-20 00:49:54,689 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-20 00:49:54,689 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 415 transitions. [2023-12-20 00:49:54,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-20 00:49:54,689 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:54,689 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-20 00:49:54,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-20 00:49:54,690 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:54,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:54,690 INFO L85 PathProgramCache]: Analyzing trace with hash -77908722, now seen corresponding path program 1 times [2023-12-20 00:49:54,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:54,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273816979] [2023-12-20 00:49:54,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:54,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:49:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:49:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:49:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:49:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:49:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:49:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,779 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-20 00:49:54,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:54,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273816979] [2023-12-20 00:49:54,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273816979] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:49:54,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:49:54,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:49:54,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141021226] [2023-12-20 00:49:54,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:54,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:49:54,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:54,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:49:54,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:49:54,781 INFO L87 Difference]: Start difference. First operand 286 states and 415 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-20 00:49:54,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:54,840 INFO L93 Difference]: Finished difference Result 559 states and 832 transitions. [2023-12-20 00:49:54,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:49:54,845 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-20 00:49:54,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:54,847 INFO L225 Difference]: With dead ends: 559 [2023-12-20 00:49:54,847 INFO L226 Difference]: Without dead ends: 330 [2023-12-20 00:49:54,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-20 00:49:54,849 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 25 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 778 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-20 00:49:54,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 778 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:49:54,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2023-12-20 00:49:54,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 327. [2023-12-20 00:49:54,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 267 states have (on average 1.3670411985018727) internal successors, (365), 270 states have internal predecessors, (365), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2023-12-20 00:49:54,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 463 transitions. [2023-12-20 00:49:54,858 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 463 transitions. Word has length 103 [2023-12-20 00:49:54,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:54,858 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 463 transitions. [2023-12-20 00:49:54,858 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-20 00:49:54,859 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 463 transitions. [2023-12-20 00:49:54,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-20 00:49:54,859 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:54,859 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-20 00:49:54,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-20 00:49:54,859 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:54,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:54,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1056143899, now seen corresponding path program 1 times [2023-12-20 00:49:54,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:54,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842236344] [2023-12-20 00:49:54,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:54,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:49:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:49:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:49:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:49:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:49:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:49:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:54,961 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-20 00:49:54,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:54,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842236344] [2023-12-20 00:49:54,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842236344] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:49:54,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:49:54,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:49:54,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649517037] [2023-12-20 00:49:54,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:54,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:49:54,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:54,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:49:54,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:49:54,962 INFO L87 Difference]: Start difference. First operand 327 states and 463 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-20 00:49:54,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:54,999 INFO L93 Difference]: Finished difference Result 585 states and 852 transitions. [2023-12-20 00:49:55,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 00:49:55,000 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-20 00:49:55,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:55,002 INFO L225 Difference]: With dead ends: 585 [2023-12-20 00:49:55,002 INFO L226 Difference]: Without dead ends: 321 [2023-12-20 00:49:55,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-20 00:49:55,004 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 15 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 738 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-20 00:49:55,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 738 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:49:55,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-12-20 00:49:55,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2023-12-20 00:49:55,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 262 states have (on average 1.3473282442748091) internal successors, (353), 265 states have internal predecessors, (353), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-20 00:49:55,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 449 transitions. [2023-12-20 00:49:55,018 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 449 transitions. Word has length 104 [2023-12-20 00:49:55,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:55,019 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 449 transitions. [2023-12-20 00:49:55,019 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-20 00:49:55,020 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 449 transitions. [2023-12-20 00:49:55,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-20 00:49:55,020 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:55,020 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-20 00:49:55,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-20 00:49:55,021 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:55,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:55,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1309382448, now seen corresponding path program 1 times [2023-12-20 00:49:55,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:55,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064828719] [2023-12-20 00:49:55,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:55,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:49:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:49:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:49:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:49:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:49:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:49:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:49:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:49:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,113 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-20 00:49:55,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:55,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064828719] [2023-12-20 00:49:55,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064828719] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:49:55,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:49:55,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 00:49:55,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170878702] [2023-12-20 00:49:55,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:55,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:49:55,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:55,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:49:55,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 00:49:55,114 INFO L87 Difference]: Start difference. First operand 321 states and 449 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-20 00:49:55,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:55,134 INFO L93 Difference]: Finished difference Result 560 states and 801 transitions. [2023-12-20 00:49:55,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:49:55,135 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-20 00:49:55,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:55,136 INFO L225 Difference]: With dead ends: 560 [2023-12-20 00:49:55,136 INFO L226 Difference]: Without dead ends: 323 [2023-12-20 00:49:55,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-20 00:49:55,137 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 0 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1023 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-20 00:49:55,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1023 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:49:55,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2023-12-20 00:49:55,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 321. [2023-12-20 00:49:55,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 262 states have (on average 1.3358778625954197) internal successors, (350), 265 states have internal predecessors, (350), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-20 00:49:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 446 transitions. [2023-12-20 00:49:55,151 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 446 transitions. Word has length 123 [2023-12-20 00:49:55,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:55,151 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 446 transitions. [2023-12-20 00:49:55,151 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-20 00:49:55,151 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 446 transitions. [2023-12-20 00:49:55,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-20 00:49:55,153 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:55,154 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-20 00:49:55,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-20 00:49:55,154 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:55,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:55,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1299230210, now seen corresponding path program 1 times [2023-12-20 00:49:55,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:55,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124180024] [2023-12-20 00:49:55,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:55,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:49:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:49:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:49:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:49:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:49:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:49:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:49:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:49:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:49:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:49:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,241 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-20 00:49:55,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:55,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124180024] [2023-12-20 00:49:55,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124180024] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:49:55,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:49:55,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:49:55,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855527482] [2023-12-20 00:49:55,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:55,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:49:55,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:55,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:49:55,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:49:55,243 INFO L87 Difference]: Start difference. First operand 321 states and 446 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-20 00:49:55,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:55,282 INFO L93 Difference]: Finished difference Result 523 states and 761 transitions. [2023-12-20 00:49:55,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 00:49:55,283 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-20 00:49:55,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:55,284 INFO L225 Difference]: With dead ends: 523 [2023-12-20 00:49:55,284 INFO L226 Difference]: Without dead ends: 319 [2023-12-20 00:49:55,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-20 00:49:55,287 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 13 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 706 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-20 00:49:55,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 706 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:49:55,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-12-20 00:49:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2023-12-20 00:49:55,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 261 states have (on average 1.3333333333333333) internal successors, (348), 264 states have internal predecessors, (348), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-20 00:49:55,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 442 transitions. [2023-12-20 00:49:55,296 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 442 transitions. Word has length 156 [2023-12-20 00:49:55,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:55,296 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 442 transitions. [2023-12-20 00:49:55,296 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-20 00:49:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 442 transitions. [2023-12-20 00:49:55,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-20 00:49:55,298 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:55,298 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] [2023-12-20 00:49:55,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-20 00:49:55,298 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:55,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:55,298 INFO L85 PathProgramCache]: Analyzing trace with hash -45969848, now seen corresponding path program 1 times [2023-12-20 00:49:55,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:55,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355331277] [2023-12-20 00:49:55,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:55,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:49:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:49:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:49:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:49:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:49:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:49:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:49:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:49:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:49:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:49:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:49:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,418 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-20 00:49:55,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:55,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355331277] [2023-12-20 00:49:55,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355331277] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:49:55,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:49:55,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:49:55,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661374516] [2023-12-20 00:49:55,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:55,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:49:55,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:55,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:49:55,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:49:55,419 INFO L87 Difference]: Start difference. First operand 319 states and 442 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-20 00:49:55,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:55,459 INFO L93 Difference]: Finished difference Result 463 states and 657 transitions. [2023-12-20 00:49:55,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:49:55,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 171 [2023-12-20 00:49:55,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:55,461 INFO L225 Difference]: With dead ends: 463 [2023-12-20 00:49:55,461 INFO L226 Difference]: Without dead ends: 302 [2023-12-20 00:49:55,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-20 00:49:55,462 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 35 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 687 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-20 00:49:55,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 687 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:49:55,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-12-20 00:49:55,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2023-12-20 00:49:55,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 247 states have (on average 1.3238866396761133) internal successors, (327), 250 states have internal predecessors, (327), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-20 00:49:55,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 415 transitions. [2023-12-20 00:49:55,472 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 415 transitions. Word has length 171 [2023-12-20 00:49:55,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:55,472 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 415 transitions. [2023-12-20 00:49:55,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-20 00:49:55,472 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 415 transitions. [2023-12-20 00:49:55,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-20 00:49:55,473 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:55,473 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] [2023-12-20 00:49:55,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-20 00:49:55,474 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:55,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:55,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2144494445, now seen corresponding path program 1 times [2023-12-20 00:49:55,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:55,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230703335] [2023-12-20 00:49:55,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:55,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:49:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:49:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:49:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:49:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:49:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:49:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:49:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:49:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:49:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:49:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:49:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:49:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,573 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-20 00:49:55,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:55,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230703335] [2023-12-20 00:49:55,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230703335] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:49:55,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:49:55,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:49:55,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345258996] [2023-12-20 00:49:55,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:55,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:49:55,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:55,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:49:55,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:49:55,576 INFO L87 Difference]: Start difference. First operand 302 states and 415 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-20 00:49:55,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:55,620 INFO L93 Difference]: Finished difference Result 446 states and 630 transitions. [2023-12-20 00:49:55,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:49:55,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 173 [2023-12-20 00:49:55,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:55,622 INFO L225 Difference]: With dead ends: 446 [2023-12-20 00:49:55,622 INFO L226 Difference]: Without dead ends: 283 [2023-12-20 00:49:55,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-20 00:49:55,623 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 30 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 691 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-20 00:49:55,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 691 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:49:55,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-12-20 00:49:55,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2023-12-20 00:49:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 231 states have (on average 1.316017316017316) internal successors, (304), 234 states have internal predecessors, (304), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-20 00:49:55,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 386 transitions. [2023-12-20 00:49:55,630 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 386 transitions. Word has length 173 [2023-12-20 00:49:55,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:55,631 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 386 transitions. [2023-12-20 00:49:55,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-20 00:49:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 386 transitions. [2023-12-20 00:49:55,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-12-20 00:49:55,632 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:55,632 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] [2023-12-20 00:49:55,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-20 00:49:55,632 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:55,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:55,632 INFO L85 PathProgramCache]: Analyzing trace with hash -307436632, now seen corresponding path program 1 times [2023-12-20 00:49:55,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:55,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44227560] [2023-12-20 00:49:55,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:55,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:49:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:49:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:49:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:49:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:49:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:49:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:49:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:49:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:49:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:49:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:49:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:49:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,762 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-20 00:49:55,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:55,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44227560] [2023-12-20 00:49:55,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44227560] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:49:55,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:49:55,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 00:49:55,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289531432] [2023-12-20 00:49:55,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:55,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:49:55,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:55,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:49:55,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 00:49:55,764 INFO L87 Difference]: Start difference. First operand 283 states and 386 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-20 00:49:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:55,785 INFO L93 Difference]: Finished difference Result 426 states and 600 transitions. [2023-12-20 00:49:55,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:49:55,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 174 [2023-12-20 00:49:55,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:55,787 INFO L225 Difference]: With dead ends: 426 [2023-12-20 00:49:55,787 INFO L226 Difference]: Without dead ends: 283 [2023-12-20 00:49:55,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-20 00:49:55,788 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 0 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1001 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-20 00:49:55,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1001 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:49:55,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-12-20 00:49:55,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2023-12-20 00:49:55,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 231 states have (on average 1.29004329004329) internal successors, (298), 234 states have internal predecessors, (298), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-20 00:49:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 380 transitions. [2023-12-20 00:49:55,797 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 380 transitions. Word has length 174 [2023-12-20 00:49:55,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:55,798 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 380 transitions. [2023-12-20 00:49:55,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-20 00:49:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 380 transitions. [2023-12-20 00:49:55,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-20 00:49:55,800 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:55,800 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] [2023-12-20 00:49:55,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-20 00:49:55,801 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:55,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:55,801 INFO L85 PathProgramCache]: Analyzing trace with hash 2068374447, now seen corresponding path program 1 times [2023-12-20 00:49:55,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:55,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424336398] [2023-12-20 00:49:55,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:55,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:49:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:49:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:49:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:49:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:49:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:49:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:49:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:49:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:49:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:49:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:49:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:55,911 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-20 00:49:55,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:55,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424336398] [2023-12-20 00:49:55,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424336398] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:49:55,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216705333] [2023-12-20 00:49:55,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:55,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:49:55,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:49:55,913 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:49:55,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-20 00:49:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-20 00:49:56,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:49:56,094 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-20 00:49:56,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 00:49:56,183 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-20 00:49:56,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216705333] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-20 00:49:56,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-20 00:49:56,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2023-12-20 00:49:56,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149975959] [2023-12-20 00:49:56,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:56,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:49:56,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:56,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:49:56,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 00:49:56,185 INFO L87 Difference]: Start difference. First operand 283 states and 380 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-20 00:49:56,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:56,218 INFO L93 Difference]: Finished difference Result 447 states and 622 transitions. [2023-12-20 00:49:56,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 00:49:56,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 181 [2023-12-20 00:49:56,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:56,219 INFO L225 Difference]: With dead ends: 447 [2023-12-20 00:49:56,219 INFO L226 Difference]: Without dead ends: 262 [2023-12-20 00:49:56,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 386 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-20 00:49:56,220 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 30 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 473 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-20 00:49:56,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 473 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:49:56,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-12-20 00:49:56,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2023-12-20 00:49:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 213 states have (on average 1.2816901408450705) internal successors, (273), 216 states have internal predecessors, (273), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-20 00:49:56,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 349 transitions. [2023-12-20 00:49:56,228 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 349 transitions. Word has length 181 [2023-12-20 00:49:56,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:56,228 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 349 transitions. [2023-12-20 00:49:56,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-20 00:49:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 349 transitions. [2023-12-20 00:49:56,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-12-20 00:49:56,229 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:56,229 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] [2023-12-20 00:49:56,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-20 00:49:56,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-20 00:49:56,435 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:56,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:56,435 INFO L85 PathProgramCache]: Analyzing trace with hash -2082007262, now seen corresponding path program 1 times [2023-12-20 00:49:56,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:56,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915605914] [2023-12-20 00:49:56,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:56,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:49:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:49:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:49:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:49:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:49:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:49:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:49:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:49:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:49:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:49:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:49:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:49:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:49:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:49:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,514 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-20 00:49:56,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:56,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915605914] [2023-12-20 00:49:56,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915605914] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:49:56,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:49:56,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:49:56,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529970773] [2023-12-20 00:49:56,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:56,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:49:56,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:56,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:49:56,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:49:56,515 INFO L87 Difference]: Start difference. First operand 262 states and 349 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-20 00:49:56,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:56,538 INFO L93 Difference]: Finished difference Result 404 states and 564 transitions. [2023-12-20 00:49:56,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:49:56,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 205 [2023-12-20 00:49:56,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:56,539 INFO L225 Difference]: With dead ends: 404 [2023-12-20 00:49:56,539 INFO L226 Difference]: Without dead ends: 268 [2023-12-20 00:49:56,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-20 00:49:56,540 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 6 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 731 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-20 00:49:56,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 731 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:49:56,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-12-20 00:49:56,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2023-12-20 00:49:56,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 216 states have (on average 1.2777777777777777) internal successors, (276), 219 states have internal predecessors, (276), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-20 00:49:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 352 transitions. [2023-12-20 00:49:56,547 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 352 transitions. Word has length 205 [2023-12-20 00:49:56,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:56,548 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 352 transitions. [2023-12-20 00:49:56,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-20 00:49:56,548 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 352 transitions. [2023-12-20 00:49:56,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-20 00:49:56,549 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:56,549 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] [2023-12-20 00:49:56,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-20 00:49:56,549 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:56,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:56,549 INFO L85 PathProgramCache]: Analyzing trace with hash -629101218, now seen corresponding path program 1 times [2023-12-20 00:49:56,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:56,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777108075] [2023-12-20 00:49:56,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:56,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:49:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:49:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:49:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:49:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:49:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:49:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:49:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:49:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:49:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:49:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:49:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:49:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:49:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:49:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:49:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2023-12-20 00:49:56,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:56,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777108075] [2023-12-20 00:49:56,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777108075] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:49:56,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058449193] [2023-12-20 00:49:56,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:56,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:49:56,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:49:56,666 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:49:56,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-20 00:49:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:56,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-20 00:49:56,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:49:56,798 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-20 00:49:56,798 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:49:56,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058449193] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:49:56,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:49:56,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-12-20 00:49:56,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89750955] [2023-12-20 00:49:56,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:56,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:49:56,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:56,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:49:56,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 00:49:56,800 INFO L87 Difference]: Start difference. First operand 266 states and 352 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 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-20 00:49:56,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:56,824 INFO L93 Difference]: Finished difference Result 413 states and 571 transitions. [2023-12-20 00:49:56,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:49:56,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 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 212 [2023-12-20 00:49:56,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:56,825 INFO L225 Difference]: With dead ends: 413 [2023-12-20 00:49:56,825 INFO L226 Difference]: Without dead ends: 273 [2023-12-20 00:49:56,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 247 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-20 00:49:56,826 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 7 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 736 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-20 00:49:56,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 736 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:49:56,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-12-20 00:49:56,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2023-12-20 00:49:56,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 220 states have (on average 1.2727272727272727) internal successors, (280), 223 states have internal predecessors, (280), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-20 00:49:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 356 transitions. [2023-12-20 00:49:56,833 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 356 transitions. Word has length 212 [2023-12-20 00:49:56,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:56,833 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 356 transitions. [2023-12-20 00:49:56,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 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-20 00:49:56,833 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 356 transitions. [2023-12-20 00:49:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2023-12-20 00:49:56,834 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:56,835 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] [2023-12-20 00:49:56,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-20 00:49:57,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:49:57,040 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:57,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:57,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1700211501, now seen corresponding path program 1 times [2023-12-20 00:49:57,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:57,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391566313] [2023-12-20 00:49:57,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:57,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:49:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:49:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:49:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:49:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:49:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:49:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:49:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:49:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:49:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:49:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:49:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:49:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:49:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:49:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:49:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-20 00:49:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,157 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2023-12-20 00:49:57,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:57,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391566313] [2023-12-20 00:49:57,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391566313] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:49:57,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104671378] [2023-12-20 00:49:57,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:57,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:49:57,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:49:57,158 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:49:57,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-20 00:49:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-20 00:49:57,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:49:57,334 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-20 00:49:57,334 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:49:57,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104671378] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:49:57,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:49:57,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-12-20 00:49:57,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899086028] [2023-12-20 00:49:57,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:57,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:49:57,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:57,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:49:57,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 00:49:57,337 INFO L87 Difference]: Start difference. First operand 271 states and 356 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 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-20 00:49:57,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:57,364 INFO L93 Difference]: Finished difference Result 415 states and 569 transitions. [2023-12-20 00:49:57,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 00:49:57,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 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 220 [2023-12-20 00:49:57,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:57,366 INFO L225 Difference]: With dead ends: 415 [2023-12-20 00:49:57,366 INFO L226 Difference]: Without dead ends: 270 [2023-12-20 00:49:57,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 257 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-20 00:49:57,367 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 7 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 722 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-20 00:49:57,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 722 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:49:57,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-12-20 00:49:57,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2023-12-20 00:49:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 220 states have (on average 1.259090909090909) internal successors, (277), 222 states have internal predecessors, (277), 37 states have call successors, (37), 12 states have call predecessors, (37), 12 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2023-12-20 00:49:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 351 transitions. [2023-12-20 00:49:57,378 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 351 transitions. Word has length 220 [2023-12-20 00:49:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:57,379 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 351 transitions. [2023-12-20 00:49:57,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 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-20 00:49:57,379 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 351 transitions. [2023-12-20 00:49:57,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-12-20 00:49:57,381 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:57,382 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] [2023-12-20 00:49:57,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-20 00:49:57,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:49:57,588 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:57,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:57,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1538712576, now seen corresponding path program 1 times [2023-12-20 00:49:57,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:57,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489814708] [2023-12-20 00:49:57,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:57,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:49:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:49:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:49:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:49:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:49:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:49:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:49:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:49:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:49:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:49:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:49:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:49:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:49:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:49:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:49:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-20 00:49:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-20 00:49:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:57,732 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-20 00:49:57,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:57,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489814708] [2023-12-20 00:49:57,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489814708] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:49:57,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:49:57,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:49:57,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220244821] [2023-12-20 00:49:57,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:57,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:49:57,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:57,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:49:57,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:49:57,733 INFO L87 Difference]: Start difference. First operand 270 states and 351 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-20 00:49:57,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:57,912 INFO L93 Difference]: Finished difference Result 413 states and 558 transitions. [2023-12-20 00:49:57,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 00:49:57,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 227 [2023-12-20 00:49:57,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:57,930 INFO L225 Difference]: With dead ends: 413 [2023-12-20 00:49:57,930 INFO L226 Difference]: Without dead ends: 269 [2023-12-20 00:49:57,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:49:57,931 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 60 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 00:49:57,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 467 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 00:49:57,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-12-20 00:49:57,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2023-12-20 00:49:57,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 220 states have (on average 1.2545454545454546) internal successors, (276), 221 states have internal predecessors, (276), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-20 00:49:57,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 348 transitions. [2023-12-20 00:49:57,943 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 348 transitions. Word has length 227 [2023-12-20 00:49:57,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:57,944 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 348 transitions. [2023-12-20 00:49:57,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-20 00:49:57,944 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 348 transitions. [2023-12-20 00:49:57,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-12-20 00:49:57,946 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:57,946 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] [2023-12-20 00:49:57,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-20 00:49:57,946 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:57,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:57,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1032392993, now seen corresponding path program 1 times [2023-12-20 00:49:57,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:57,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846398969] [2023-12-20 00:49:57,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:57,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:49:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:49:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:49:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:49:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:49:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:49:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:49:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:49:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:49:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:49:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:49:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:49:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:49:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:49:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:49:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-20 00:49:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-20 00:49:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,105 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-20 00:49:58,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:58,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846398969] [2023-12-20 00:49:58,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846398969] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:49:58,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:49:58,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 00:49:58,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19183433] [2023-12-20 00:49:58,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:58,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:49:58,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:58,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:49:58,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 00:49:58,107 INFO L87 Difference]: Start difference. First operand 269 states and 348 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-20 00:49:58,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:58,459 INFO L93 Difference]: Finished difference Result 617 states and 826 transitions. [2023-12-20 00:49:58,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-20 00:49:58,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 230 [2023-12-20 00:49:58,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:58,463 INFO L225 Difference]: With dead ends: 617 [2023-12-20 00:49:58,463 INFO L226 Difference]: Without dead ends: 474 [2023-12-20 00:49:58,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-20 00:49:58,464 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 403 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 00:49:58,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 617 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 00:49:58,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2023-12-20 00:49:58,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 420. [2023-12-20 00:49:58,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 341 states have (on average 1.3020527859237536) internal successors, (444), 343 states have internal predecessors, (444), 54 states have call successors, (54), 24 states have call predecessors, (54), 24 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-20 00:49:58,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 552 transitions. [2023-12-20 00:49:58,494 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 552 transitions. Word has length 230 [2023-12-20 00:49:58,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:58,494 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 552 transitions. [2023-12-20 00:49:58,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-20 00:49:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 552 transitions. [2023-12-20 00:49:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-12-20 00:49:58,496 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:58,496 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:49:58,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-20 00:49:58,496 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:58,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:58,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1253081541, now seen corresponding path program 1 times [2023-12-20 00:49:58,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:58,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201897752] [2023-12-20 00:49:58,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:58,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:49:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:49:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:49:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:49:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:49:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:49:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:49:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:49:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:49:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:49:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:49:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:49:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:49:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:49:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:49:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-20 00:49:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-20 00:49:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2023-12-20 00:49:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-12-20 00:49:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-12-20 00:49:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:58,605 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2023-12-20 00:49:58,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:58,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201897752] [2023-12-20 00:49:58,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201897752] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:49:58,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:49:58,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:49:58,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657975401] [2023-12-20 00:49:58,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:58,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:49:58,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:58,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:49:58,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:49:58,607 INFO L87 Difference]: Start difference. First operand 420 states and 552 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-20 00:49:58,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:58,896 INFO L93 Difference]: Finished difference Result 886 states and 1218 transitions. [2023-12-20 00:49:58,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:49:58,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 256 [2023-12-20 00:49:58,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:58,899 INFO L225 Difference]: With dead ends: 886 [2023-12-20 00:49:58,899 INFO L226 Difference]: Without dead ends: 660 [2023-12-20 00:49:58,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-20 00:49:58,900 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 219 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 00:49:58,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 464 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 00:49:58,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2023-12-20 00:49:58,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 498. [2023-12-20 00:49:58,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 409 states have (on average 1.312958435207824) internal successors, (537), 412 states have internal predecessors, (537), 59 states have call successors, (59), 29 states have call predecessors, (59), 29 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2023-12-20 00:49:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 655 transitions. [2023-12-20 00:49:58,939 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 655 transitions. Word has length 256 [2023-12-20 00:49:58,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:58,956 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 655 transitions. [2023-12-20 00:49:58,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-20 00:49:58,956 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 655 transitions. [2023-12-20 00:49:58,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2023-12-20 00:49:58,958 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:58,958 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:49:58,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-20 00:49:58,958 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:58,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:58,959 INFO L85 PathProgramCache]: Analyzing trace with hash 377452701, now seen corresponding path program 1 times [2023-12-20 00:49:58,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:58,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171834930] [2023-12-20 00:49:58,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:58,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:49:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:49:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:49:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:49:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:49:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:49:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:49:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:49:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:49:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:49:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:49:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:49:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:49:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:49:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:49:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-20 00:49:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-20 00:49:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-12-20 00:49:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2023-12-20 00:49:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-12-20 00:49:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2023-12-20 00:49:59,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:59,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171834930] [2023-12-20 00:49:59,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171834930] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:49:59,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:49:59,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:49:59,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360640575] [2023-12-20 00:49:59,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:59,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:49:59,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:59,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:49:59,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:49:59,110 INFO L87 Difference]: Start difference. First operand 498 states and 655 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-20 00:49:59,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:59,389 INFO L93 Difference]: Finished difference Result 1054 states and 1443 transitions. [2023-12-20 00:49:59,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:49:59,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 257 [2023-12-20 00:49:59,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:59,393 INFO L225 Difference]: With dead ends: 1054 [2023-12-20 00:49:59,393 INFO L226 Difference]: Without dead ends: 779 [2023-12-20 00:49:59,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-20 00:49:59,394 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 220 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 00:49:59,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 492 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 00:49:59,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2023-12-20 00:49:59,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 604. [2023-12-20 00:49:59,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 503 states have (on average 1.3260437375745526) internal successors, (667), 508 states have internal predecessors, (667), 65 states have call successors, (65), 35 states have call predecessors, (65), 35 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2023-12-20 00:49:59,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 797 transitions. [2023-12-20 00:49:59,422 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 797 transitions. Word has length 257 [2023-12-20 00:49:59,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:59,422 INFO L495 AbstractCegarLoop]: Abstraction has 604 states and 797 transitions. [2023-12-20 00:49:59,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-20 00:49:59,423 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 797 transitions. [2023-12-20 00:49:59,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-20 00:49:59,424 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:59,425 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:49:59,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-20 00:49:59,425 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:59,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:59,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1837145120, now seen corresponding path program 1 times [2023-12-20 00:49:59,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:59,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765793999] [2023-12-20 00:49:59,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:59,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:49:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:49:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:49:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:49:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:49:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:49:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:49:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:49:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:49:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:49:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:49:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:49:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:49:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:49:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:49:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-20 00:49:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-20 00:49:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-12-20 00:49:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-20 00:49:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2023-12-20 00:49:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,520 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2023-12-20 00:49:59,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:49:59,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765793999] [2023-12-20 00:49:59,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765793999] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:49:59,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:49:59,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:49:59,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501225097] [2023-12-20 00:49:59,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:49:59,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:49:59,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:49:59,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:49:59,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:49:59,522 INFO L87 Difference]: Start difference. First operand 604 states and 797 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-20 00:49:59,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:49:59,793 INFO L93 Difference]: Finished difference Result 1258 states and 1725 transitions. [2023-12-20 00:49:59,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:49:59,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 258 [2023-12-20 00:49:59,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:49:59,796 INFO L225 Difference]: With dead ends: 1258 [2023-12-20 00:49:59,796 INFO L226 Difference]: Without dead ends: 909 [2023-12-20 00:49:59,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-20 00:49:59,797 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 220 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 00:49:59,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 519 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 00:49:59,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2023-12-20 00:49:59,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 706. [2023-12-20 00:49:59,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 597 states have (on average 1.3450586264656617) internal successors, (803), 606 states have internal predecessors, (803), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2023-12-20 00:49:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 941 transitions. [2023-12-20 00:49:59,853 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 941 transitions. Word has length 258 [2023-12-20 00:49:59,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:49:59,853 INFO L495 AbstractCegarLoop]: Abstraction has 706 states and 941 transitions. [2023-12-20 00:49:59,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-20 00:49:59,854 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 941 transitions. [2023-12-20 00:49:59,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-20 00:49:59,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:49:59,855 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:49:59,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-20 00:49:59,856 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:49:59,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:49:59,856 INFO L85 PathProgramCache]: Analyzing trace with hash 2111904734, now seen corresponding path program 1 times [2023-12-20 00:49:59,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:49:59,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949106145] [2023-12-20 00:49:59,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:49:59,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:49:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:49:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:49:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:49:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:49:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:49:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:49:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:49:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:49:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:49:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:49:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:49:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:49:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:49:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:49:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:49:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:49:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:49:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-20 00:49:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-20 00:49:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:49:59,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-12-20 00:49:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-20 00:50:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2023-12-20 00:50:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,008 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2023-12-20 00:50:00,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:50:00,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949106145] [2023-12-20 00:50:00,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949106145] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:50:00,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073470577] [2023-12-20 00:50:00,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:50:00,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:50:00,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:50:00,026 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:50:00,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-20 00:50:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 00:50:00,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:50:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2023-12-20 00:50:00,210 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:50:00,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073470577] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:50:00,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:50:00,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-12-20 00:50:00,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426141386] [2023-12-20 00:50:00,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:50:00,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:50:00,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:50:00,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:50:00,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-20 00:50:00,212 INFO L87 Difference]: Start difference. First operand 706 states and 941 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-20 00:50:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:50:00,294 INFO L93 Difference]: Finished difference Result 1161 states and 1589 transitions. [2023-12-20 00:50:00,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:50:00,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 258 [2023-12-20 00:50:00,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:50:00,297 INFO L225 Difference]: With dead ends: 1161 [2023-12-20 00:50:00,297 INFO L226 Difference]: Without dead ends: 706 [2023-12-20 00:50:00,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-20 00:50:00,299 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 51 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:50:00,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 639 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:50:00,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2023-12-20 00:50:00,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2023-12-20 00:50:00,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 597 states have (on average 1.3350083752093802) internal successors, (797), 606 states have internal predecessors, (797), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2023-12-20 00:50:00,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 935 transitions. [2023-12-20 00:50:00,331 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 935 transitions. Word has length 258 [2023-12-20 00:50:00,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:50:00,331 INFO L495 AbstractCegarLoop]: Abstraction has 706 states and 935 transitions. [2023-12-20 00:50:00,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-20 00:50:00,331 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 935 transitions. [2023-12-20 00:50:00,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2023-12-20 00:50:00,333 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:50:00,333 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, 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-20 00:50:00,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-20 00:50:00,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-20 00:50:00,539 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:50:00,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:50:00,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1894713939, now seen corresponding path program 1 times [2023-12-20 00:50:00,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:50:00,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107558601] [2023-12-20 00:50:00,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:50:00,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:50:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:50:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:50:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:50:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:50:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:50:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:50:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:50:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:50:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:50:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:50:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:50:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:50:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:50:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:50:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:50:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-20 00:50:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-20 00:50:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-12-20 00:50:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-12-20 00:50:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-12-20 00:50:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,746 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2023-12-20 00:50:00,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:50:00,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107558601] [2023-12-20 00:50:00,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107558601] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:50:00,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312823128] [2023-12-20 00:50:00,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:50:00,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:50:00,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:50:00,747 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:50:00,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-20 00:50:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:00,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 00:50:00,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:50:00,919 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2023-12-20 00:50:00,919 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:50:00,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312823128] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:50:00,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:50:00,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-12-20 00:50:00,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434238087] [2023-12-20 00:50:00,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:50:00,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:50:00,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:50:00,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:50:00,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-20 00:50:00,922 INFO L87 Difference]: Start difference. First operand 706 states and 935 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-20 00:50:00,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:50:00,982 INFO L93 Difference]: Finished difference Result 1161 states and 1575 transitions. [2023-12-20 00:50:00,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:50:00,983 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 259 [2023-12-20 00:50:00,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:50:00,986 INFO L225 Difference]: With dead ends: 1161 [2023-12-20 00:50:00,986 INFO L226 Difference]: Without dead ends: 718 [2023-12-20 00:50:00,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-20 00:50:00,987 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 15 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:50:00,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 662 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:50:00,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2023-12-20 00:50:01,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2023-12-20 00:50:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 607 states have (on average 1.3360790774299836) internal successors, (811), 616 states have internal predecessors, (811), 69 states have call successors, (69), 41 states have call predecessors, (69), 41 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2023-12-20 00:50:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 949 transitions. [2023-12-20 00:50:01,027 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 949 transitions. Word has length 259 [2023-12-20 00:50:01,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:50:01,027 INFO L495 AbstractCegarLoop]: Abstraction has 718 states and 949 transitions. [2023-12-20 00:50:01,028 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-20 00:50:01,028 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 949 transitions. [2023-12-20 00:50:01,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2023-12-20 00:50:01,030 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:50:01,030 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 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, 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-20 00:50:01,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-20 00:50:01,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-20 00:50:01,237 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:50:01,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:50:01,237 INFO L85 PathProgramCache]: Analyzing trace with hash 710936248, now seen corresponding path program 1 times [2023-12-20 00:50:01,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:50:01,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311618064] [2023-12-20 00:50:01,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:50:01,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:50:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:50:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:50:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:50:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:50:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:50:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:50:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:50:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:50:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:50:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:50:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:50:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:50:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:50:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:50:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:50:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-20 00:50:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-20 00:50:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-12-20 00:50:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-12-20 00:50:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-12-20 00:50:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2023-12-20 00:50:01,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:50:01,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311618064] [2023-12-20 00:50:01,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311618064] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:50:01,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:50:01,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:50:01,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948789962] [2023-12-20 00:50:01,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:50:01,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:50:01,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:50:01,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:50:01,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:50:01,424 INFO L87 Difference]: Start difference. First operand 718 states and 949 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-20 00:50:01,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:50:01,633 INFO L93 Difference]: Finished difference Result 1175 states and 1589 transitions. [2023-12-20 00:50:01,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 00:50:01,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 260 [2023-12-20 00:50:01,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:50:01,636 INFO L225 Difference]: With dead ends: 1175 [2023-12-20 00:50:01,636 INFO L226 Difference]: Without dead ends: 700 [2023-12-20 00:50:01,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:50:01,637 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 59 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 00:50:01,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 465 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 00:50:01,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2023-12-20 00:50:01,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2023-12-20 00:50:01,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 590 states have (on average 1.3186440677966103) internal successors, (778), 598 states have internal predecessors, (778), 69 states have call successors, (69), 41 states have call predecessors, (69), 40 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-20 00:50:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 915 transitions. [2023-12-20 00:50:01,664 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 915 transitions. Word has length 260 [2023-12-20 00:50:01,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:50:01,664 INFO L495 AbstractCegarLoop]: Abstraction has 700 states and 915 transitions. [2023-12-20 00:50:01,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-20 00:50:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 915 transitions. [2023-12-20 00:50:01,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2023-12-20 00:50:01,665 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:50:01,666 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 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, 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-20 00:50:01,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-20 00:50:01,666 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:50:01,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:50:01,666 INFO L85 PathProgramCache]: Analyzing trace with hash -648363165, now seen corresponding path program 1 times [2023-12-20 00:50:01,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:50:01,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668319961] [2023-12-20 00:50:01,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:50:01,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:50:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:50:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:50:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:50:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:50:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:50:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:50:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:50:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:50:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:50:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:50:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:50:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:50:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:50:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:50:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:50:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-20 00:50:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-20 00:50:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-20 00:50:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-20 00:50:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-12-20 00:50:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:01,916 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2023-12-20 00:50:01,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:50:01,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668319961] [2023-12-20 00:50:01,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668319961] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:50:01,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:50:01,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 00:50:01,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797763671] [2023-12-20 00:50:01,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:50:01,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 00:50:01,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:50:01,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 00:50:01,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 00:50:01,918 INFO L87 Difference]: Start difference. First operand 700 states and 915 transitions. Second operand has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-20 00:50:02,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:50:02,360 INFO L93 Difference]: Finished difference Result 1007 states and 1393 transitions. [2023-12-20 00:50:02,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-20 00:50:02,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 261 [2023-12-20 00:50:02,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:50:02,364 INFO L225 Difference]: With dead ends: 1007 [2023-12-20 00:50:02,364 INFO L226 Difference]: Without dead ends: 1005 [2023-12-20 00:50:02,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-20 00:50:02,365 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 237 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 00:50:02,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1460 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 00:50:02,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2023-12-20 00:50:02,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 706. [2023-12-20 00:50:02,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 594 states have (on average 1.3164983164983164) internal successors, (782), 603 states have internal predecessors, (782), 70 states have call successors, (70), 42 states have call predecessors, (70), 41 states have return successors, (69), 67 states have call predecessors, (69), 69 states have call successors, (69) [2023-12-20 00:50:02,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 921 transitions. [2023-12-20 00:50:02,403 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 921 transitions. Word has length 261 [2023-12-20 00:50:02,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:50:02,403 INFO L495 AbstractCegarLoop]: Abstraction has 706 states and 921 transitions. [2023-12-20 00:50:02,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-20 00:50:02,403 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 921 transitions. [2023-12-20 00:50:02,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2023-12-20 00:50:02,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:50:02,405 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 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, 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] [2023-12-20 00:50:02,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-20 00:50:02,405 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:50:02,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:50:02,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1275808175, now seen corresponding path program 1 times [2023-12-20 00:50:02,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:50:02,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148414095] [2023-12-20 00:50:02,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:50:02,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:50:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:50:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:50:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:50:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:50:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:50:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:50:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:50:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:50:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:50:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:50:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:50:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:50:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:50:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:50:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:50:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-20 00:50:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-20 00:50:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-20 00:50:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-20 00:50:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-12-20 00:50:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-12-20 00:50:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,645 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2023-12-20 00:50:02,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:50:02,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148414095] [2023-12-20 00:50:02,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148414095] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:50:02,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184673587] [2023-12-20 00:50:02,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:50:02,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:50:02,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:50:02,647 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:50:02,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-20 00:50:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:02,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-20 00:50:02,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:50:02,977 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 251 proven. 33 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2023-12-20 00:50:02,978 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 00:50:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2023-12-20 00:50:03,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184673587] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 00:50:03,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 00:50:03,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2023-12-20 00:50:03,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684054597] [2023-12-20 00:50:03,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 00:50:03,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-20 00:50:03,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:50:03,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-20 00:50:03,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2023-12-20 00:50:03,229 INFO L87 Difference]: Start difference. First operand 706 states and 921 transitions. Second operand has 19 states, 19 states have (on average 7.526315789473684) internal successors, (143), 14 states have internal predecessors, (143), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2023-12-20 00:50:04,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:50:04,559 INFO L93 Difference]: Finished difference Result 1744 states and 2386 transitions. [2023-12-20 00:50:04,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-20 00:50:04,560 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.526315789473684) internal successors, (143), 14 states have internal predecessors, (143), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) Word has length 269 [2023-12-20 00:50:04,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:50:04,564 INFO L225 Difference]: With dead ends: 1744 [2023-12-20 00:50:04,564 INFO L226 Difference]: Without dead ends: 1299 [2023-12-20 00:50:04,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 580 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2023-12-20 00:50:04,566 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 408 mSDsluCounter, 2008 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-20 00:50:04,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 2230 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1590 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-20 00:50:04,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2023-12-20 00:50:04,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 967. [2023-12-20 00:50:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 815 states have (on average 1.2993865030674847) internal successors, (1059), 825 states have internal predecessors, (1059), 94 states have call successors, (94), 55 states have call predecessors, (94), 57 states have return successors, (98), 93 states have call predecessors, (98), 93 states have call successors, (98) [2023-12-20 00:50:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1251 transitions. [2023-12-20 00:50:04,612 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1251 transitions. Word has length 269 [2023-12-20 00:50:04,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:50:04,612 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1251 transitions. [2023-12-20 00:50:04,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.526315789473684) internal successors, (143), 14 states have internal predecessors, (143), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2023-12-20 00:50:04,612 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1251 transitions. [2023-12-20 00:50:04,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2023-12-20 00:50:04,614 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:50:04,614 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 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, 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] [2023-12-20 00:50:04,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-20 00:50:04,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:50:04,821 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:50:04,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:50:04,822 INFO L85 PathProgramCache]: Analyzing trace with hash -2057545104, now seen corresponding path program 1 times [2023-12-20 00:50:04,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:50:04,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469376913] [2023-12-20 00:50:04,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:50:04,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:50:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:50:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:50:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:50:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:50:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:50:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:50:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:50:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:50:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:50:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:50:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:50:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:50:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:50:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:50:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:50:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-20 00:50:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-20 00:50:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-20 00:50:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-20 00:50:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-12-20 00:50:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-12-20 00:50:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2023-12-20 00:50:04,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:50:04,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469376913] [2023-12-20 00:50:04,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469376913] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:50:04,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691048620] [2023-12-20 00:50:04,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:50:04,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:50:04,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:50:04,941 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:50:04,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-20 00:50:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-20 00:50:05,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:50:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2023-12-20 00:50:05,105 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:50:05,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691048620] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:50:05,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:50:05,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-12-20 00:50:05,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286219627] [2023-12-20 00:50:05,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:50:05,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:50:05,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:50:05,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:50:05,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 00:50:05,107 INFO L87 Difference]: Start difference. First operand 967 states and 1251 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-20 00:50:05,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:50:05,219 INFO L93 Difference]: Finished difference Result 1798 states and 2367 transitions. [2023-12-20 00:50:05,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:50:05,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 269 [2023-12-20 00:50:05,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:50:05,222 INFO L225 Difference]: With dead ends: 1798 [2023-12-20 00:50:05,223 INFO L226 Difference]: Without dead ends: 951 [2023-12-20 00:50:05,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 315 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-20 00:50:05,225 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 11 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:50:05,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 659 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:50:05,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2023-12-20 00:50:05,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 951. [2023-12-20 00:50:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 804 states have (on average 1.287313432835821) internal successors, (1035), 814 states have internal predecessors, (1035), 90 states have call successors, (90), 55 states have call predecessors, (90), 56 states have return successors, (93), 88 states have call predecessors, (93), 89 states have call successors, (93) [2023-12-20 00:50:05,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1218 transitions. [2023-12-20 00:50:05,263 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1218 transitions. Word has length 269 [2023-12-20 00:50:05,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:50:05,263 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1218 transitions. [2023-12-20 00:50:05,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-20 00:50:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1218 transitions. [2023-12-20 00:50:05,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2023-12-20 00:50:05,265 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:50:05,265 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 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, 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] [2023-12-20 00:50:05,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-20 00:50:05,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-12-20 00:50:05,471 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:50:05,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:50:05,471 INFO L85 PathProgramCache]: Analyzing trace with hash -629738955, now seen corresponding path program 1 times [2023-12-20 00:50:05,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:50:05,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599820480] [2023-12-20 00:50:05,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:50:05,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:50:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:50:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:50:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:50:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:50:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:50:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:50:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:50:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:50:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:50:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:50:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:50:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:50:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:50:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-20 00:50:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 00:50:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-12-20 00:50:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2023-12-20 00:50:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2023-12-20 00:50:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2023-12-20 00:50:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-20 00:50:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-12-20 00:50:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-12-20 00:50:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,581 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2023-12-20 00:50:05,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:50:05,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599820480] [2023-12-20 00:50:05,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599820480] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:50:05,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134336022] [2023-12-20 00:50:05,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:50:05,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:50:05,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:50:05,597 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:50:05,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-20 00:50:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:05,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-20 00:50:05,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:50:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2023-12-20 00:50:05,790 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:50:05,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134336022] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:50:05,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:50:05,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-12-20 00:50:05,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299246886] [2023-12-20 00:50:05,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:50:05,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:50:05,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:50:05,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:50:05,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 00:50:05,792 INFO L87 Difference]: Start difference. First operand 951 states and 1218 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, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-20 00:50:05,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:50:05,871 INFO L93 Difference]: Finished difference Result 1646 states and 2151 transitions. [2023-12-20 00:50:05,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:50:05,871 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, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 272 [2023-12-20 00:50:05,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:50:05,875 INFO L225 Difference]: With dead ends: 1646 [2023-12-20 00:50:05,875 INFO L226 Difference]: Without dead ends: 806 [2023-12-20 00:50:05,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 318 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-20 00:50:05,877 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 8 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 662 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-20 00:50:05,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 662 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:50:05,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2023-12-20 00:50:05,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2023-12-20 00:50:05,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 677 states have (on average 1.2880354505169866) internal successors, (872), 687 states have internal predecessors, (872), 81 states have call successors, (81), 48 states have call predecessors, (81), 47 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-20 00:50:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1033 transitions. [2023-12-20 00:50:05,919 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1033 transitions. Word has length 272 [2023-12-20 00:50:05,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:50:05,920 INFO L495 AbstractCegarLoop]: Abstraction has 806 states and 1033 transitions. [2023-12-20 00:50:05,920 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, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-20 00:50:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1033 transitions. [2023-12-20 00:50:05,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2023-12-20 00:50:05,922 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:50:05,922 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 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] [2023-12-20 00:50:05,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-20 00:50:06,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:50:06,129 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:50:06,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:50:06,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2123303412, now seen corresponding path program 1 times [2023-12-20 00:50:06,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:50:06,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893707247] [2023-12-20 00:50:06,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:50:06,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:50:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:50:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:50:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:50:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:50:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:50:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:50:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:50:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:50:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:50:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:50:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:50:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:50:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:50:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:50:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:50:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-20 00:50:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-20 00:50:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-20 00:50:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-20 00:50:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-12-20 00:50:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-12-20 00:50:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2023-12-20 00:50:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-12-20 00:50:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,739 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 16 proven. 146 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2023-12-20 00:50:06,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:50:06,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893707247] [2023-12-20 00:50:06,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893707247] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:50:06,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522891008] [2023-12-20 00:50:06,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:50:06,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:50:06,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:50:06,740 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:50:06,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-20 00:50:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:06,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-20 00:50:06,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:50:07,122 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2023-12-20 00:50:07,122 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:50:07,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522891008] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:50:07,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:50:07,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2023-12-20 00:50:07,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780918560] [2023-12-20 00:50:07,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:50:07,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 00:50:07,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:50:07,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 00:50:07,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2023-12-20 00:50:07,126 INFO L87 Difference]: Start difference. First operand 806 states and 1033 transitions. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 7 states have internal predecessors, (103), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-20 00:50:07,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:50:07,361 INFO L93 Difference]: Finished difference Result 1539 states and 1999 transitions. [2023-12-20 00:50:07,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 00:50:07,362 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 7 states have internal predecessors, (103), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 284 [2023-12-20 00:50:07,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:50:07,367 INFO L225 Difference]: With dead ends: 1539 [2023-12-20 00:50:07,367 INFO L226 Difference]: Without dead ends: 1087 [2023-12-20 00:50:07,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2023-12-20 00:50:07,369 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 133 mSDsluCounter, 1387 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:50:07,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1700 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:50:07,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2023-12-20 00:50:07,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 961. [2023-12-20 00:50:07,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 804 states have (on average 1.2823383084577114) internal successors, (1031), 815 states have internal predecessors, (1031), 99 states have call successors, (99), 58 states have call predecessors, (99), 57 states have return successors, (98), 94 states have call predecessors, (98), 98 states have call successors, (98) [2023-12-20 00:50:07,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1228 transitions. [2023-12-20 00:50:07,442 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1228 transitions. Word has length 284 [2023-12-20 00:50:07,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:50:07,443 INFO L495 AbstractCegarLoop]: Abstraction has 961 states and 1228 transitions. [2023-12-20 00:50:07,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 7 states have internal predecessors, (103), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-20 00:50:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1228 transitions. [2023-12-20 00:50:07,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2023-12-20 00:50:07,445 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:50:07,446 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, 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] [2023-12-20 00:50:07,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-20 00:50:07,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-12-20 00:50:07,653 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:50:07,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:50:07,653 INFO L85 PathProgramCache]: Analyzing trace with hash 678129265, now seen corresponding path program 1 times [2023-12-20 00:50:07,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:50:07,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278978621] [2023-12-20 00:50:07,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:50:07,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:50:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:50:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:50:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:50:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:50:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:50:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:50:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:50:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:50:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:50:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:50:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:50:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:50:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:50:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:50:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:50:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-20 00:50:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-20 00:50:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-20 00:50:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-20 00:50:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2023-12-20 00:50:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2023-12-20 00:50:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-12-20 00:50:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2023-12-20 00:50:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:07,859 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2023-12-20 00:50:07,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:50:07,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278978621] [2023-12-20 00:50:07,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278978621] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:50:07,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:50:07,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 00:50:07,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868877410] [2023-12-20 00:50:07,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:50:07,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 00:50:07,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:50:07,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 00:50:07,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-20 00:50:07,861 INFO L87 Difference]: Start difference. First operand 961 states and 1228 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2023-12-20 00:50:08,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:50:08,231 INFO L93 Difference]: Finished difference Result 1895 states and 2575 transitions. [2023-12-20 00:50:08,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 00:50:08,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 290 [2023-12-20 00:50:08,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:50:08,238 INFO L225 Difference]: With dead ends: 1895 [2023-12-20 00:50:08,238 INFO L226 Difference]: Without dead ends: 1273 [2023-12-20 00:50:08,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-20 00:50:08,239 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 182 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 00:50:08,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1204 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 00:50:08,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2023-12-20 00:50:08,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1016. [2023-12-20 00:50:08,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 847 states have (on average 1.2927981109799291) internal successors, (1095), 858 states have internal predecessors, (1095), 111 states have call successors, (111), 58 states have call predecessors, (111), 57 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2023-12-20 00:50:08,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1316 transitions. [2023-12-20 00:50:08,293 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1316 transitions. Word has length 290 [2023-12-20 00:50:08,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:50:08,294 INFO L495 AbstractCegarLoop]: Abstraction has 1016 states and 1316 transitions. [2023-12-20 00:50:08,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2023-12-20 00:50:08,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1316 transitions. [2023-12-20 00:50:08,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2023-12-20 00:50:08,295 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:50:08,295 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, 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] [2023-12-20 00:50:08,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-20 00:50:08,296 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:50:08,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:50:08,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1152285715, now seen corresponding path program 1 times [2023-12-20 00:50:08,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:50:08,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060642819] [2023-12-20 00:50:08,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:50:08,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:50:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:50:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:50:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:50:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:50:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:50:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:50:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:50:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:50:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:50:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:50:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:50:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:50:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:50:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:50:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:50:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-20 00:50:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-20 00:50:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-20 00:50:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-20 00:50:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2023-12-20 00:50:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2023-12-20 00:50:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-12-20 00:50:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2023-12-20 00:50:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,637 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-20 00:50:08,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:50:08,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060642819] [2023-12-20 00:50:08,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060642819] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:50:08,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331382632] [2023-12-20 00:50:08,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:50:08,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:50:08,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:50:08,662 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:50:08,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-20 00:50:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:08,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-20 00:50:08,833 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:50:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2023-12-20 00:50:08,981 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:50:08,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331382632] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:50:08,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:50:08,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 17 [2023-12-20 00:50:08,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681073100] [2023-12-20 00:50:08,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:50:08,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-20 00:50:08,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:50:08,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-20 00:50:08,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2023-12-20 00:50:08,982 INFO L87 Difference]: Start difference. First operand 1016 states and 1316 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2023-12-20 00:50:09,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:50:09,535 INFO L93 Difference]: Finished difference Result 2480 states and 3290 transitions. [2023-12-20 00:50:09,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-20 00:50:09,535 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 290 [2023-12-20 00:50:09,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:50:09,541 INFO L225 Difference]: With dead ends: 2480 [2023-12-20 00:50:09,541 INFO L226 Difference]: Without dead ends: 1804 [2023-12-20 00:50:09,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=800, Unknown=0, NotChecked=0, Total=930 [2023-12-20 00:50:09,543 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 765 mSDsluCounter, 2111 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 00:50:09,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 2436 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 00:50:09,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2023-12-20 00:50:09,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1185. [2023-12-20 00:50:09,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 984 states have (on average 1.285569105691057) internal successors, (1265), 997 states have internal predecessors, (1265), 133 states have call successors, (133), 68 states have call predecessors, (133), 67 states have return successors, (132), 126 states have call predecessors, (132), 132 states have call successors, (132) [2023-12-20 00:50:09,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1530 transitions. [2023-12-20 00:50:09,604 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1530 transitions. Word has length 290 [2023-12-20 00:50:09,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:50:09,604 INFO L495 AbstractCegarLoop]: Abstraction has 1185 states and 1530 transitions. [2023-12-20 00:50:09,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2023-12-20 00:50:09,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1530 transitions. [2023-12-20 00:50:09,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2023-12-20 00:50:09,606 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:50:09,606 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, 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] [2023-12-20 00:50:09,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-20 00:50:09,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-12-20 00:50:09,813 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:50:09,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:50:09,813 INFO L85 PathProgramCache]: Analyzing trace with hash -265230867, now seen corresponding path program 1 times [2023-12-20 00:50:09,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:50:09,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884206004] [2023-12-20 00:50:09,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:50:09,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:50:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:50:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:50:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:50:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:50:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:50:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:50:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:50:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:50:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:50:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:50:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:50:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:50:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:50:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:50:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:50:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-20 00:50:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-20 00:50:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-20 00:50:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-20 00:50:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2023-12-20 00:50:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2023-12-20 00:50:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-12-20 00:50:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2023-12-20 00:50:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-20 00:50:10,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:50:10,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884206004] [2023-12-20 00:50:10,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884206004] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:50:10,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210194149] [2023-12-20 00:50:10,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:50:10,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:50:10,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:50:10,132 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:50:10,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-20 00:50:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:10,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-20 00:50:10,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:50:10,368 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2023-12-20 00:50:10,368 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:50:10,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210194149] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:50:10,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:50:10,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 15 [2023-12-20 00:50:10,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010667088] [2023-12-20 00:50:10,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:50:10,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 00:50:10,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:50:10,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 00:50:10,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2023-12-20 00:50:10,370 INFO L87 Difference]: Start difference. First operand 1185 states and 1530 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-20 00:50:10,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:50:10,668 INFO L93 Difference]: Finished difference Result 2279 states and 3022 transitions. [2023-12-20 00:50:10,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 00:50:10,668 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 290 [2023-12-20 00:50:10,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:50:10,673 INFO L225 Difference]: With dead ends: 2279 [2023-12-20 00:50:10,673 INFO L226 Difference]: Without dead ends: 1431 [2023-12-20 00:50:10,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2023-12-20 00:50:10,675 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 180 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 2108 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 00:50:10,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 2108 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 00:50:10,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2023-12-20 00:50:10,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1163. [2023-12-20 00:50:10,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 968 states have (on average 1.28099173553719) internal successors, (1240), 981 states have internal predecessors, (1240), 127 states have call successors, (127), 68 states have call predecessors, (127), 67 states have return successors, (126), 120 states have call predecessors, (126), 126 states have call successors, (126) [2023-12-20 00:50:10,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1493 transitions. [2023-12-20 00:50:10,731 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1493 transitions. Word has length 290 [2023-12-20 00:50:10,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:50:10,732 INFO L495 AbstractCegarLoop]: Abstraction has 1163 states and 1493 transitions. [2023-12-20 00:50:10,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-20 00:50:10,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1493 transitions. [2023-12-20 00:50:10,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2023-12-20 00:50:10,733 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:50:10,734 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 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, 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] [2023-12-20 00:50:10,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-20 00:50:10,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-12-20 00:50:10,941 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:50:10,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:50:10,941 INFO L85 PathProgramCache]: Analyzing trace with hash -948675796, now seen corresponding path program 1 times [2023-12-20 00:50:10,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:50:10,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834968974] [2023-12-20 00:50:10,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:50:10,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:50:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:50:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:50:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:50:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:50:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:50:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:50:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:50:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:50:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:50:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:50:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:50:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:50:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:50:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:50:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:50:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-20 00:50:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-20 00:50:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-20 00:50:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-20 00:50:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-12-20 00:50:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2023-12-20 00:50:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2023-12-20 00:50:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-12-20 00:50:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2023-12-20 00:50:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2023-12-20 00:50:11,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:50:11,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834968974] [2023-12-20 00:50:11,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834968974] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:50:11,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:50:11,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 00:50:11,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491281780] [2023-12-20 00:50:11,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:50:11,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:50:11,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:50:11,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:50:11,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 00:50:11,059 INFO L87 Difference]: Start difference. First operand 1163 states and 1493 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-20 00:50:11,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:50:11,544 INFO L93 Difference]: Finished difference Result 1920 states and 2486 transitions. [2023-12-20 00:50:11,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 00:50:11,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 298 [2023-12-20 00:50:11,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:50:11,551 INFO L225 Difference]: With dead ends: 1920 [2023-12-20 00:50:11,552 INFO L226 Difference]: Without dead ends: 1106 [2023-12-20 00:50:11,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-20 00:50:11,553 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 477 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 00:50:11,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 750 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 00:50:11,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2023-12-20 00:50:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 869. [2023-12-20 00:50:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 738 states have (on average 1.2560975609756098) internal successors, (927), 741 states have internal predecessors, (927), 85 states have call successors, (85), 45 states have call predecessors, (85), 45 states have return successors, (85), 82 states have call predecessors, (85), 85 states have call successors, (85) [2023-12-20 00:50:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1097 transitions. [2023-12-20 00:50:11,618 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1097 transitions. Word has length 298 [2023-12-20 00:50:11,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:50:11,618 INFO L495 AbstractCegarLoop]: Abstraction has 869 states and 1097 transitions. [2023-12-20 00:50:11,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-20 00:50:11,618 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1097 transitions. [2023-12-20 00:50:11,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2023-12-20 00:50:11,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:50:11,621 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-20 00:50:11,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-20 00:50:11,621 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:50:11,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:50:11,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1441935166, now seen corresponding path program 1 times [2023-12-20 00:50:11,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:50:11,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300787084] [2023-12-20 00:50:11,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:50:11,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:50:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:50:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:50:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:50:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:50:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:50:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:50:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:50:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:50:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:50:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:50:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:50:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:50:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:50:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:50:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:50:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-20 00:50:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-20 00:50:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-20 00:50:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-20 00:50:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-12-20 00:50:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2023-12-20 00:50:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2023-12-20 00:50:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2023-12-20 00:50:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-12-20 00:50:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2023-12-20 00:50:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2023-12-20 00:50:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2023-12-20 00:50:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2023-12-20 00:50:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,278 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2023-12-20 00:50:12,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:50:12,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300787084] [2023-12-20 00:50:12,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300787084] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:50:12,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163039126] [2023-12-20 00:50:12,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:50:12,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:50:12,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:50:12,280 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:50:12,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-20 00:50:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:12,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-20 00:50:12,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:50:12,841 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 224 proven. 74 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2023-12-20 00:50:12,842 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 00:50:13,575 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 34 proven. 70 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2023-12-20 00:50:13,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163039126] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 00:50:13,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 00:50:13,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 34 [2023-12-20 00:50:13,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827916794] [2023-12-20 00:50:13,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 00:50:13,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-20 00:50:13,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:50:13,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-20 00:50:13,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2023-12-20 00:50:13,578 INFO L87 Difference]: Start difference. First operand 869 states and 1097 transitions. Second operand has 34 states, 34 states have (on average 7.117647058823529) internal successors, (242), 29 states have internal predecessors, (242), 9 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (53), 13 states have call predecessors, (53), 9 states have call successors, (53) [2023-12-20 00:50:32,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:50:32,804 INFO L93 Difference]: Finished difference Result 8501 states and 11474 transitions. [2023-12-20 00:50:32,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 405 states. [2023-12-20 00:50:32,804 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 7.117647058823529) internal successors, (242), 29 states have internal predecessors, (242), 9 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (53), 13 states have call predecessors, (53), 9 states have call successors, (53) Word has length 337 [2023-12-20 00:50:32,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:50:32,835 INFO L225 Difference]: With dead ends: 8501 [2023-12-20 00:50:32,835 INFO L226 Difference]: Without dead ends: 7925 [2023-12-20 00:50:32,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1167 GetRequests, 725 SyntacticMatches, 8 SemanticMatches, 434 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80121 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=13037, Invalid=176623, Unknown=0, NotChecked=0, Total=189660 [2023-12-20 00:50:32,859 INFO L413 NwaCegarLoop]: 683 mSDtfsCounter, 6798 mSDsluCounter, 12271 mSDsCounter, 0 mSdLazyCounter, 12160 mSolverCounterSat, 1912 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6798 SdHoareTripleChecker+Valid, 12954 SdHoareTripleChecker+Invalid, 14072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1912 IncrementalHoareTripleChecker+Valid, 12160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:50:32,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6798 Valid, 12954 Invalid, 14072 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1912 Valid, 12160 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2023-12-20 00:50:32,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7925 states. [2023-12-20 00:50:33,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7925 to 3489. [2023-12-20 00:50:33,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3489 states, 2811 states have (on average 1.262895766631092) internal successors, (3550), 2844 states have internal predecessors, (3550), 456 states have call successors, (456), 203 states have call predecessors, (456), 221 states have return successors, (483), 441 states have call predecessors, (483), 456 states have call successors, (483) [2023-12-20 00:50:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 4489 transitions. [2023-12-20 00:50:33,288 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 4489 transitions. Word has length 337 [2023-12-20 00:50:33,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:50:33,289 INFO L495 AbstractCegarLoop]: Abstraction has 3489 states and 4489 transitions. [2023-12-20 00:50:33,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.117647058823529) internal successors, (242), 29 states have internal predecessors, (242), 9 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (53), 13 states have call predecessors, (53), 9 states have call successors, (53) [2023-12-20 00:50:33,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 4489 transitions. [2023-12-20 00:50:33,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2023-12-20 00:50:33,298 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:50:33,299 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-20 00:50:33,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-20 00:50:33,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-12-20 00:50:33,507 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:50:33,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:50:33,508 INFO L85 PathProgramCache]: Analyzing trace with hash -2049863081, now seen corresponding path program 1 times [2023-12-20 00:50:33,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:50:33,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841820903] [2023-12-20 00:50:33,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:50:33,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:50:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:50:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:50:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:50:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:50:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:50:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:50:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:50:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:50:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:50:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:50:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:50:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:50:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:50:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:50:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:50:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:50:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-20 00:50:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-20 00:50:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-12-20 00:50:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-12-20 00:50:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2023-12-20 00:50:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-12-20 00:50:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-20 00:50:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2023-12-20 00:50:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2023-12-20 00:50:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2023-12-20 00:50:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2023-12-20 00:50:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2023-12-20 00:50:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2023-12-20 00:50:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 16 proven. 22 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2023-12-20 00:50:34,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:50:34,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841820903] [2023-12-20 00:50:34,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841820903] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:50:34,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812332852] [2023-12-20 00:50:34,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:50:34,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:50:34,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:50:34,485 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:50:34,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-20 00:50:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:50:34,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-20 00:50:34,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:50:35,068 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 190 proven. 101 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2023-12-20 00:50:35,069 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 00:50:35,519 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 33 proven. 68 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2023-12-20 00:50:35,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812332852] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 00:50:35,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 00:50:35,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 35 [2023-12-20 00:50:35,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945961701] [2023-12-20 00:50:35,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 00:50:35,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-20 00:50:35,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:50:35,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-20 00:50:35,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1099, Unknown=0, NotChecked=0, Total=1190 [2023-12-20 00:50:35,522 INFO L87 Difference]: Start difference. First operand 3489 states and 4489 transitions. Second operand has 35 states, 35 states have (on average 6.942857142857143) internal successors, (243), 30 states have internal predecessors, (243), 10 states have call successors, (54), 9 states have call predecessors, (54), 14 states have return successors, (54), 14 states have call predecessors, (54), 10 states have call successors, (54) [2023-12-20 00:51:07,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:51:07,338 INFO L93 Difference]: Finished difference Result 15240 states and 19651 transitions. [2023-12-20 00:51:07,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 418 states. [2023-12-20 00:51:07,338 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 6.942857142857143) internal successors, (243), 30 states have internal predecessors, (243), 10 states have call successors, (54), 9 states have call predecessors, (54), 14 states have return successors, (54), 14 states have call predecessors, (54), 10 states have call successors, (54) Word has length 338 [2023-12-20 00:51:07,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:51:07,363 INFO L225 Difference]: With dead ends: 15240 [2023-12-20 00:51:07,364 INFO L226 Difference]: Without dead ends: 12231 [2023-12-20 00:51:07,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1182 GetRequests, 732 SyntacticMatches, 1 SemanticMatches, 449 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85677 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=14265, Invalid=188685, Unknown=0, NotChecked=0, Total=202950 [2023-12-20 00:51:07,382 INFO L413 NwaCegarLoop]: 813 mSDtfsCounter, 6326 mSDsluCounter, 13867 mSDsCounter, 0 mSdLazyCounter, 17462 mSolverCounterSat, 1773 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6326 SdHoareTripleChecker+Valid, 14680 SdHoareTripleChecker+Invalid, 19235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1773 IncrementalHoareTripleChecker+Valid, 17462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-12-20 00:51:07,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6326 Valid, 14680 Invalid, 19235 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1773 Valid, 17462 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2023-12-20 00:51:07,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12231 states. [2023-12-20 00:51:07,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12231 to 4005. [2023-12-20 00:51:07,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4005 states, 3284 states have (on average 1.2490864799025578) internal successors, (4102), 3324 states have internal predecessors, (4102), 451 states have call successors, (451), 244 states have call predecessors, (451), 269 states have return successors, (486), 436 states have call predecessors, (486), 451 states have call successors, (486) [2023-12-20 00:51:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4005 states to 4005 states and 5039 transitions. [2023-12-20 00:51:07,906 INFO L78 Accepts]: Start accepts. Automaton has 4005 states and 5039 transitions. Word has length 338 [2023-12-20 00:51:07,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:51:07,906 INFO L495 AbstractCegarLoop]: Abstraction has 4005 states and 5039 transitions. [2023-12-20 00:51:07,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.942857142857143) internal successors, (243), 30 states have internal predecessors, (243), 10 states have call successors, (54), 9 states have call predecessors, (54), 14 states have return successors, (54), 14 states have call predecessors, (54), 10 states have call successors, (54) [2023-12-20 00:51:07,906 INFO L276 IsEmpty]: Start isEmpty. Operand 4005 states and 5039 transitions. [2023-12-20 00:51:07,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2023-12-20 00:51:07,915 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:51:07,915 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-20 00:51:07,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-20 00:51:08,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:51:08,122 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:51:08,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:51:08,123 INFO L85 PathProgramCache]: Analyzing trace with hash 49511652, now seen corresponding path program 1 times [2023-12-20 00:51:08,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:51:08,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711991849] [2023-12-20 00:51:08,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:51:08,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:51:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:51:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:51:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:51:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:51:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:51:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:51:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:51:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:51:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:51:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:51:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:51:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:51:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:51:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:51:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:51:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:51:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:51:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-20 00:51:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-20 00:51:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-12-20 00:51:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-12-20 00:51:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2023-12-20 00:51:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-12-20 00:51:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-20 00:51:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2023-12-20 00:51:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2023-12-20 00:51:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2023-12-20 00:51:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2023-12-20 00:51:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2023-12-20 00:51:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2023-12-20 00:51:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,283 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2023-12-20 00:51:08,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:51:08,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711991849] [2023-12-20 00:51:08,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711991849] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:51:08,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623798970] [2023-12-20 00:51:08,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:51:08,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:51:08,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:51:08,292 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:51:08,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-20 00:51:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:08,549 INFO L262 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-20 00:51:08,553 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:51:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2023-12-20 00:51:08,562 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:51:08,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623798970] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:51:08,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:51:08,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-12-20 00:51:08,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76575971] [2023-12-20 00:51:08,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:51:08,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:51:08,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:51:08,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:51:08,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 00:51:08,564 INFO L87 Difference]: Start difference. First operand 4005 states and 5039 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-20 00:51:09,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:51:09,054 INFO L93 Difference]: Finished difference Result 8144 states and 10232 transitions. [2023-12-20 00:51:09,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:51:09,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 338 [2023-12-20 00:51:09,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:51:09,084 INFO L225 Difference]: With dead ends: 8144 [2023-12-20 00:51:09,084 INFO L226 Difference]: Without dead ends: 3935 [2023-12-20 00:51:09,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 398 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-20 00:51:09,104 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 40 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:51:09,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 618 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:51:09,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3935 states. [2023-12-20 00:51:09,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3935 to 3935. [2023-12-20 00:51:09,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3935 states, 3239 states have (on average 1.216116085211485) internal successors, (3939), 3264 states have internal predecessors, (3939), 451 states have call successors, (451), 244 states have call predecessors, (451), 244 states have return successors, (451), 426 states have call predecessors, (451), 451 states have call successors, (451) [2023-12-20 00:51:09,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3935 states to 3935 states and 4841 transitions. [2023-12-20 00:51:09,547 INFO L78 Accepts]: Start accepts. Automaton has 3935 states and 4841 transitions. Word has length 338 [2023-12-20 00:51:09,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:51:09,548 INFO L495 AbstractCegarLoop]: Abstraction has 3935 states and 4841 transitions. [2023-12-20 00:51:09,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-20 00:51:09,548 INFO L276 IsEmpty]: Start isEmpty. Operand 3935 states and 4841 transitions. [2023-12-20 00:51:09,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2023-12-20 00:51:09,597 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:51:09,598 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-20 00:51:09,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-20 00:51:09,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-12-20 00:51:09,798 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:51:09,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:51:09,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1286221910, now seen corresponding path program 1 times [2023-12-20 00:51:09,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:51:09,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595029150] [2023-12-20 00:51:09,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:51:09,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:51:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:51:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:51:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:51:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:51:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:51:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:51:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:51:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:51:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:51:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:51:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:51:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:51:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:51:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:51:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:51:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:51:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:51:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-20 00:51:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-20 00:51:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-12-20 00:51:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-12-20 00:51:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2023-12-20 00:51:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-12-20 00:51:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-20 00:51:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2023-12-20 00:51:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2023-12-20 00:51:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2023-12-20 00:51:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2023-12-20 00:51:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2023-12-20 00:51:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-12-20 00:51:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2023-12-20 00:51:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,568 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [2023-12-20 00:51:10,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:51:10,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595029150] [2023-12-20 00:51:10,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595029150] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:51:10,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105756446] [2023-12-20 00:51:10,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:51:10,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:51:10,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:51:10,585 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:51:10,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-20 00:51:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:10,831 INFO L262 TraceCheckSpWp]: Trace formula consists of 1241 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-20 00:51:10,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:51:11,172 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 321 proven. 118 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2023-12-20 00:51:11,172 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 00:51:11,649 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 44 proven. 204 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2023-12-20 00:51:11,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105756446] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 00:51:11,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 00:51:11,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 18] total 40 [2023-12-20 00:51:11,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957243876] [2023-12-20 00:51:11,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 00:51:11,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-20 00:51:11,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:51:11,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-20 00:51:11,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1455, Unknown=0, NotChecked=0, Total=1560 [2023-12-20 00:51:11,651 INFO L87 Difference]: Start difference. First operand 3935 states and 4841 transitions. Second operand has 40 states, 39 states have (on average 7.435897435897436) internal successors, (290), 34 states have internal predecessors, (290), 12 states have call successors, (65), 10 states have call predecessors, (65), 12 states have return successors, (66), 15 states have call predecessors, (66), 11 states have call successors, (66) [2023-12-20 00:51:28,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:51:28,803 INFO L93 Difference]: Finished difference Result 27171 states and 36431 transitions. [2023-12-20 00:51:28,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 319 states. [2023-12-20 00:51:28,804 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 7.435897435897436) internal successors, (290), 34 states have internal predecessors, (290), 12 states have call successors, (65), 10 states have call predecessors, (65), 12 states have return successors, (66), 15 states have call predecessors, (66), 11 states have call successors, (66) Word has length 348 [2023-12-20 00:51:28,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:51:28,858 INFO L225 Difference]: With dead ends: 27171 [2023-12-20 00:51:28,858 INFO L226 Difference]: Without dead ends: 23799 [2023-12-20 00:51:28,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1111 GetRequests, 757 SyntacticMatches, 0 SemanticMatches, 354 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51357 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=7686, Invalid=118694, Unknown=0, NotChecked=0, Total=126380 [2023-12-20 00:51:28,875 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 6244 mSDsluCounter, 11931 mSDsCounter, 0 mSdLazyCounter, 10602 mSolverCounterSat, 1651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6257 SdHoareTripleChecker+Valid, 12369 SdHoareTripleChecker+Invalid, 12253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1651 IncrementalHoareTripleChecker+Valid, 10602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-12-20 00:51:28,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6257 Valid, 12369 Invalid, 12253 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1651 Valid, 10602 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-12-20 00:51:28,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23799 states. [2023-12-20 00:51:29,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23799 to 4334. [2023-12-20 00:51:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4334 states, 3584 states have (on average 1.2087053571428572) internal successors, (4332), 3609 states have internal predecessors, (4332), 480 states have call successors, (480), 267 states have call predecessors, (480), 269 states have return successors, (484), 457 states have call predecessors, (484), 480 states have call successors, (484) [2023-12-20 00:51:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4334 states to 4334 states and 5296 transitions. [2023-12-20 00:51:29,586 INFO L78 Accepts]: Start accepts. Automaton has 4334 states and 5296 transitions. Word has length 348 [2023-12-20 00:51:29,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:51:29,586 INFO L495 AbstractCegarLoop]: Abstraction has 4334 states and 5296 transitions. [2023-12-20 00:51:29,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 7.435897435897436) internal successors, (290), 34 states have internal predecessors, (290), 12 states have call successors, (65), 10 states have call predecessors, (65), 12 states have return successors, (66), 15 states have call predecessors, (66), 11 states have call successors, (66) [2023-12-20 00:51:29,587 INFO L276 IsEmpty]: Start isEmpty. Operand 4334 states and 5296 transitions. [2023-12-20 00:51:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2023-12-20 00:51:29,594 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:51:29,594 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-20 00:51:29,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-20 00:51:29,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:51:29,801 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:51:29,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:51:29,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1713555860, now seen corresponding path program 1 times [2023-12-20 00:51:29,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:51:29,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295476502] [2023-12-20 00:51:29,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:51:29,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:51:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:51:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:51:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 00:51:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-20 00:51:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-20 00:51:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:51:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:51:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:51:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-20 00:51:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:51:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:51:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:51:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-12-20 00:51:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:51:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:51:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:51:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-12-20 00:51:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-20 00:51:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-20 00:51:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-12-20 00:51:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-12-20 00:51:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-20 00:51:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2023-12-20 00:51:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2023-12-20 00:51:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2023-12-20 00:51:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2023-12-20 00:51:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2023-12-20 00:51:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2023-12-20 00:51:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2023-12-20 00:51:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2023-12-20 00:51:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2023-12-20 00:51:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 940 backedges. 9 proven. 136 refuted. 0 times theorem prover too weak. 795 trivial. 0 not checked. [2023-12-20 00:51:29,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:51:29,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295476502] [2023-12-20 00:51:29,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295476502] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:51:29,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102513171] [2023-12-20 00:51:29,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:51:29,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:51:29,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:51:29,919 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:51:29,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-20 00:51:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:30,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 1241 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-20 00:51:30,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:51:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 940 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2023-12-20 00:51:30,158 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:51:30,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102513171] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:51:30,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:51:30,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-12-20 00:51:30,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113238535] [2023-12-20 00:51:30,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:51:30,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:51:30,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:51:30,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:51:30,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 00:51:30,159 INFO L87 Difference]: Start difference. First operand 4334 states and 5296 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-20 00:51:30,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:51:30,661 INFO L93 Difference]: Finished difference Result 8271 states and 10138 transitions. [2023-12-20 00:51:30,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:51:30,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 352 [2023-12-20 00:51:30,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:51:30,669 INFO L225 Difference]: With dead ends: 8271 [2023-12-20 00:51:30,669 INFO L226 Difference]: Without dead ends: 3937 [2023-12-20 00:51:30,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 414 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-20 00:51:30,674 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 28 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:51:30,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 625 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:51:30,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3937 states. [2023-12-20 00:51:31,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3937 to 3937. [2023-12-20 00:51:31,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3937 states, 3240 states have (on average 1.2135802469135804) internal successors, (3932), 3265 states have internal predecessors, (3932), 451 states have call successors, (451), 245 states have call predecessors, (451), 245 states have return successors, (451), 426 states have call predecessors, (451), 451 states have call successors, (451) [2023-12-20 00:51:31,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3937 states and 4834 transitions. [2023-12-20 00:51:31,132 INFO L78 Accepts]: Start accepts. Automaton has 3937 states and 4834 transitions. Word has length 352 [2023-12-20 00:51:31,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:51:31,133 INFO L495 AbstractCegarLoop]: Abstraction has 3937 states and 4834 transitions. [2023-12-20 00:51:31,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-20 00:51:31,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3937 states and 4834 transitions. [2023-12-20 00:51:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2023-12-20 00:51:31,139 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:51:31,139 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-20 00:51:31,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-20 00:51:31,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:51:31,345 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:51:31,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:51:31,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1636753079, now seen corresponding path program 1 times [2023-12-20 00:51:31,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:51:31,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067263093] [2023-12-20 00:51:31,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:51:31,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:51:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:51:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:51:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:51:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:51:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:51:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:51:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:51:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:51:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:51:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:51:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:51:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:51:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:51:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:51:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:51:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:51:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:51:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-20 00:51:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-20 00:51:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-20 00:51:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-12-20 00:51:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-12-20 00:51:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2023-12-20 00:51:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2023-12-20 00:51:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2023-12-20 00:51:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2023-12-20 00:51:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2023-12-20 00:51:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2023-12-20 00:51:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2023-12-20 00:51:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2023-12-20 00:51:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2023-12-20 00:51:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2023-12-20 00:51:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:31,870 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 50 proven. 48 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2023-12-20 00:51:31,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:51:31,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067263093] [2023-12-20 00:51:31,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067263093] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:51:31,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210511963] [2023-12-20 00:51:31,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:51:31,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:51:31,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:51:31,882 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:51:31,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-20 00:51:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:32,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-20 00:51:32,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:51:33,081 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 466 proven. 227 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2023-12-20 00:51:33,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 00:51:33,901 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 100 proven. 194 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2023-12-20 00:51:33,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210511963] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 00:51:33,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 00:51:33,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 27, 22] total 57 [2023-12-20 00:51:33,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951130617] [2023-12-20 00:51:33,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 00:51:33,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-12-20 00:51:33,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:51:33,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-12-20 00:51:33,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=2954, Unknown=0, NotChecked=0, Total=3192 [2023-12-20 00:51:33,904 INFO L87 Difference]: Start difference. First operand 3937 states and 4834 transitions. Second operand has 57 states, 57 states have (on average 6.7368421052631575) internal successors, (384), 48 states have internal predecessors, (384), 16 states have call successors, (67), 13 states have call predecessors, (67), 23 states have return successors, (72), 23 states have call predecessors, (72), 16 states have call successors, (72) [2023-12-20 00:51:50,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:51:50,211 INFO L93 Difference]: Finished difference Result 20621 states and 25676 transitions. [2023-12-20 00:51:50,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2023-12-20 00:51:50,212 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 6.7368421052631575) internal successors, (384), 48 states have internal predecessors, (384), 16 states have call successors, (67), 13 states have call predecessors, (67), 23 states have return successors, (72), 23 states have call predecessors, (72), 16 states have call successors, (72) Word has length 359 [2023-12-20 00:51:50,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:51:50,249 INFO L225 Difference]: With dead ends: 20621 [2023-12-20 00:51:50,249 INFO L226 Difference]: Without dead ends: 17075 [2023-12-20 00:51:50,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1027 GetRequests, 771 SyntacticMatches, 0 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23047 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=5703, Invalid=60603, Unknown=0, NotChecked=0, Total=66306 [2023-12-20 00:51:50,264 INFO L413 NwaCegarLoop]: 1015 mSDtfsCounter, 6692 mSDsluCounter, 22413 mSDsCounter, 0 mSdLazyCounter, 14400 mSolverCounterSat, 2060 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6692 SdHoareTripleChecker+Valid, 23428 SdHoareTripleChecker+Invalid, 16460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2060 IncrementalHoareTripleChecker+Valid, 14400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-12-20 00:51:50,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6692 Valid, 23428 Invalid, 16460 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2060 Valid, 14400 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2023-12-20 00:51:50,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17075 states. [2023-12-20 00:51:52,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17075 to 11622. [2023-12-20 00:51:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11622 states, 9402 states have (on average 1.1885768985322271) internal successors, (11175), 9506 states have internal predecessors, (11175), 1422 states have call successors, (1422), 797 states have call predecessors, (1422), 797 states have return successors, (1422), 1318 states have call predecessors, (1422), 1422 states have call successors, (1422) [2023-12-20 00:51:52,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11622 states to 11622 states and 14019 transitions. [2023-12-20 00:51:52,221 INFO L78 Accepts]: Start accepts. Automaton has 11622 states and 14019 transitions. Word has length 359 [2023-12-20 00:51:52,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:51:52,223 INFO L495 AbstractCegarLoop]: Abstraction has 11622 states and 14019 transitions. [2023-12-20 00:51:52,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 6.7368421052631575) internal successors, (384), 48 states have internal predecessors, (384), 16 states have call successors, (67), 13 states have call predecessors, (67), 23 states have return successors, (72), 23 states have call predecessors, (72), 16 states have call successors, (72) [2023-12-20 00:51:52,223 INFO L276 IsEmpty]: Start isEmpty. Operand 11622 states and 14019 transitions. [2023-12-20 00:51:52,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2023-12-20 00:51:52,241 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:51:52,242 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:51:52,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-12-20 00:51:52,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:51:52,448 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:51:52,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:51:52,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1640230850, now seen corresponding path program 1 times [2023-12-20 00:51:52,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:51:52,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039427042] [2023-12-20 00:51:52,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:51:52,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:51:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:51:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:51:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:51:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:51:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:51:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:51:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:51:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:51:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:51:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:51:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:51:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:51:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:51:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:51:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:51:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:51:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:51:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2023-12-20 00:51:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-12-20 00:51:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-20 00:51:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-12-20 00:51:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-12-20 00:51:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-12-20 00:51:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2023-12-20 00:51:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2023-12-20 00:51:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2023-12-20 00:51:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2023-12-20 00:51:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2023-12-20 00:51:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2023-12-20 00:51:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2023-12-20 00:51:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2023-12-20 00:51:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2023-12-20 00:51:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2023-12-20 00:51:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:52,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1061 trivial. 0 not checked. [2023-12-20 00:51:52,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:51:52,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039427042] [2023-12-20 00:51:52,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039427042] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:51:52,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:51:52,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:51:52,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862062574] [2023-12-20 00:51:52,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:51:52,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:51:52,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:51:52,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:51:52,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:51:52,646 INFO L87 Difference]: Start difference. First operand 11622 states and 14019 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-20 00:51:53,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:51:53,981 INFO L93 Difference]: Finished difference Result 17566 states and 21177 transitions. [2023-12-20 00:51:53,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 00:51:53,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 370 [2023-12-20 00:51:53,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:51:54,001 INFO L225 Difference]: With dead ends: 17566 [2023-12-20 00:51:54,001 INFO L226 Difference]: Without dead ends: 6546 [2023-12-20 00:51:54,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:51:54,018 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 55 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:51:54,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 446 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:51:54,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6546 states. [2023-12-20 00:51:55,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6546 to 6546. [2023-12-20 00:51:55,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6546 states, 5303 states have (on average 1.1780124457854044) internal successors, (6247), 5362 states have internal predecessors, (6247), 790 states have call successors, (790), 452 states have call predecessors, (790), 452 states have return successors, (790), 731 states have call predecessors, (790), 790 states have call successors, (790) [2023-12-20 00:51:55,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6546 states to 6546 states and 7827 transitions. [2023-12-20 00:51:55,245 INFO L78 Accepts]: Start accepts. Automaton has 6546 states and 7827 transitions. Word has length 370 [2023-12-20 00:51:55,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:51:55,247 INFO L495 AbstractCegarLoop]: Abstraction has 6546 states and 7827 transitions. [2023-12-20 00:51:55,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-20 00:51:55,247 INFO L276 IsEmpty]: Start isEmpty. Operand 6546 states and 7827 transitions. [2023-12-20 00:51:55,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2023-12-20 00:51:55,284 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:51:55,285 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 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, 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] [2023-12-20 00:51:55,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-12-20 00:51:55,285 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:51:55,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:51:55,286 INFO L85 PathProgramCache]: Analyzing trace with hash -343513865, now seen corresponding path program 1 times [2023-12-20 00:51:55,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:51:55,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258199366] [2023-12-20 00:51:55,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:51:55,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:51:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:51:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:51:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:51:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:51:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:51:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:51:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:51:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:51:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:51:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:51:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:51:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:51:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:51:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:51:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:51:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:51:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:51:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-20 00:51:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-12-20 00:51:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2023-12-20 00:51:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-20 00:51:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-12-20 00:51:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2023-12-20 00:51:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-12-20 00:51:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2023-12-20 00:51:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2023-12-20 00:51:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2023-12-20 00:51:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2023-12-20 00:51:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2023-12-20 00:51:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2023-12-20 00:51:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2023-12-20 00:51:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2023-12-20 00:51:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2023-12-20 00:51:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1062 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1054 trivial. 0 not checked. [2023-12-20 00:51:55,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:51:55,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258199366] [2023-12-20 00:51:55,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258199366] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:51:55,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:51:55,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 00:51:55,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682898106] [2023-12-20 00:51:55,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:51:55,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:51:55,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:51:55,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:51:55,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:51:55,513 INFO L87 Difference]: Start difference. First operand 6546 states and 7827 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-20 00:51:56,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:51:56,341 INFO L93 Difference]: Finished difference Result 9961 states and 11945 transitions. [2023-12-20 00:51:56,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 00:51:56,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 371 [2023-12-20 00:51:56,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:51:56,349 INFO L225 Difference]: With dead ends: 9961 [2023-12-20 00:51:56,350 INFO L226 Difference]: Without dead ends: 3849 [2023-12-20 00:51:56,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 00:51:56,356 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 55 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:51:56,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 440 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:51:56,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3849 states. [2023-12-20 00:51:57,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3849 to 3849. [2023-12-20 00:51:57,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3849 states, 3142 states have (on average 1.1775938892425206) internal successors, (3700), 3171 states have internal predecessors, (3700), 446 states have call successors, (446), 260 states have call predecessors, (446), 260 states have return successors, (446), 417 states have call predecessors, (446), 446 states have call successors, (446) [2023-12-20 00:51:57,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 4592 transitions. [2023-12-20 00:51:57,042 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 4592 transitions. Word has length 371 [2023-12-20 00:51:57,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:51:57,043 INFO L495 AbstractCegarLoop]: Abstraction has 3849 states and 4592 transitions. [2023-12-20 00:51:57,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-20 00:51:57,043 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 4592 transitions. [2023-12-20 00:51:57,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2023-12-20 00:51:57,050 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:51:57,050 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 10, 9, 8, 8, 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, 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] [2023-12-20 00:51:57,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-12-20 00:51:57,050 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:51:57,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:51:57,051 INFO L85 PathProgramCache]: Analyzing trace with hash 240027645, now seen corresponding path program 1 times [2023-12-20 00:51:57,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:51:57,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224756186] [2023-12-20 00:51:57,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:51:57,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:51:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:51:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:51:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:51:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:51:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:51:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:51:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:51:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:51:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:51:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:51:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:51:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:51:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:51:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:51:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:51:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:51:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:51:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-20 00:51:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-20 00:51:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-12-20 00:51:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-12-20 00:51:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2023-12-20 00:51:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2023-12-20 00:51:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2023-12-20 00:51:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2023-12-20 00:51:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2023-12-20 00:51:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2023-12-20 00:51:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2023-12-20 00:51:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2023-12-20 00:51:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2023-12-20 00:51:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2023-12-20 00:51:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2023-12-20 00:51:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2023-12-20 00:51:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2023-12-20 00:51:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 45 proven. 18 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2023-12-20 00:51:57,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:51:57,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224756186] [2023-12-20 00:51:57,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224756186] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:51:57,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411944363] [2023-12-20 00:51:57,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:51:57,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:51:57,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:51:57,356 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:51:57,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-20 00:51:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:51:57,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 1317 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-20 00:51:57,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:51:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 127 proven. 304 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2023-12-20 00:51:58,024 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 00:51:58,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 17 proven. 30 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2023-12-20 00:51:58,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411944363] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 00:51:58,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 00:51:58,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 22 [2023-12-20 00:51:58,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047311811] [2023-12-20 00:51:58,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 00:51:58,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-20 00:51:58,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:51:58,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-20 00:51:58,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2023-12-20 00:51:58,301 INFO L87 Difference]: Start difference. First operand 3849 states and 4592 transitions. Second operand has 22 states, 22 states have (on average 12.454545454545455) internal successors, (274), 18 states have internal predecessors, (274), 8 states have call successors, (67), 7 states have call predecessors, (67), 10 states have return successors, (66), 11 states have call predecessors, (66), 8 states have call successors, (66) [2023-12-20 00:52:05,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:52:05,617 INFO L93 Difference]: Finished difference Result 22917 states and 28103 transitions. [2023-12-20 00:52:05,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2023-12-20 00:52:05,618 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 12.454545454545455) internal successors, (274), 18 states have internal predecessors, (274), 8 states have call successors, (67), 7 states have call predecessors, (67), 10 states have return successors, (66), 11 states have call predecessors, (66), 8 states have call successors, (66) Word has length 376 [2023-12-20 00:52:05,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:52:05,657 INFO L225 Difference]: With dead ends: 22917 [2023-12-20 00:52:05,657 INFO L226 Difference]: Without dead ends: 19594 [2023-12-20 00:52:05,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 949 GetRequests, 817 SyntacticMatches, 9 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5342 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1454, Invalid=14046, Unknown=0, NotChecked=0, Total=15500 [2023-12-20 00:52:05,663 INFO L413 NwaCegarLoop]: 346 mSDtfsCounter, 1827 mSDsluCounter, 4421 mSDsCounter, 0 mSdLazyCounter, 4186 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1841 SdHoareTripleChecker+Valid, 4767 SdHoareTripleChecker+Invalid, 4616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 4186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-20 00:52:05,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1841 Valid, 4767 Invalid, 4616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 4186 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-20 00:52:05,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19594 states. [2023-12-20 00:52:07,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19594 to 6973. [2023-12-20 00:52:07,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6973 states, 5717 states have (on average 1.1777155850970789) internal successors, (6733), 5762 states have internal predecessors, (6733), 788 states have call successors, (788), 467 states have call predecessors, (788), 467 states have return successors, (788), 743 states have call predecessors, (788), 788 states have call successors, (788) [2023-12-20 00:52:07,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6973 states to 6973 states and 8309 transitions. [2023-12-20 00:52:07,027 INFO L78 Accepts]: Start accepts. Automaton has 6973 states and 8309 transitions. Word has length 376 [2023-12-20 00:52:07,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:52:07,027 INFO L495 AbstractCegarLoop]: Abstraction has 6973 states and 8309 transitions. [2023-12-20 00:52:07,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 12.454545454545455) internal successors, (274), 18 states have internal predecessors, (274), 8 states have call successors, (67), 7 states have call predecessors, (67), 10 states have return successors, (66), 11 states have call predecessors, (66), 8 states have call successors, (66) [2023-12-20 00:52:07,028 INFO L276 IsEmpty]: Start isEmpty. Operand 6973 states and 8309 transitions. [2023-12-20 00:52:07,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2023-12-20 00:52:07,034 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:52:07,035 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 12, 12, 10, 9, 7, 7, 7, 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, 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] [2023-12-20 00:52:07,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-12-20 00:52:07,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:52:07,241 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:52:07,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:52:07,241 INFO L85 PathProgramCache]: Analyzing trace with hash 98813656, now seen corresponding path program 1 times [2023-12-20 00:52:07,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:52:07,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981856495] [2023-12-20 00:52:07,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:52:07,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:52:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:52:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 00:52:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:52:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 00:52:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:52:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-20 00:52:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 00:52:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:52:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:52:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-20 00:52:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:52:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:52:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 00:52:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 00:52:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:52:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:52:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-20 00:52:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-20 00:52:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-20 00:52:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-20 00:52:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-12-20 00:52:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-12-20 00:52:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-12-20 00:52:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2023-12-20 00:52:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2023-12-20 00:52:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2023-12-20 00:52:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2023-12-20 00:52:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2023-12-20 00:52:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2023-12-20 00:52:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2023-12-20 00:52:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2023-12-20 00:52:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2023-12-20 00:52:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2023-12-20 00:52:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2023-12-20 00:52:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 136 proven. 132 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2023-12-20 00:52:07,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:52:07,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981856495] [2023-12-20 00:52:07,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981856495] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:52:07,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268354639] [2023-12-20 00:52:07,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:52:07,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:52:07,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:52:07,754 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:52:07,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-20 00:52:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:52:07,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 1317 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-20 00:52:07,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:52:08,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 611 proven. 249 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2023-12-20 00:52:08,846 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 00:52:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 154 proven. 160 refuted. 0 times theorem prover too weak. 826 trivial. 0 not checked. [2023-12-20 00:52:09,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268354639] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 00:52:09,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 00:52:09,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 26, 21] total 50 [2023-12-20 00:52:09,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555250562] [2023-12-20 00:52:09,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 00:52:09,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-20 00:52:09,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:52:09,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-20 00:52:09,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=2225, Unknown=0, NotChecked=0, Total=2450 [2023-12-20 00:52:09,894 INFO L87 Difference]: Start difference. First operand 6973 states and 8309 transitions. Second operand has 50 states, 50 states have (on average 7.38) internal successors, (369), 42 states have internal predecessors, (369), 14 states have call successors, (62), 11 states have call predecessors, (62), 24 states have return successors, (65), 21 states have call predecessors, (65), 14 states have call successors, (65) [2023-12-20 00:52:14,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:52:14,346 INFO L93 Difference]: Finished difference Result 14741 states and 17914 transitions. [2023-12-20 00:52:14,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-20 00:52:14,346 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 7.38) internal successors, (369), 42 states have internal predecessors, (369), 14 states have call successors, (62), 11 states have call predecessors, (62), 24 states have return successors, (65), 21 states have call predecessors, (65), 14 states have call successors, (65) Word has length 381 [2023-12-20 00:52:14,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:52:14,361 INFO L225 Difference]: With dead ends: 14741 [2023-12-20 00:52:14,361 INFO L226 Difference]: Without dead ends: 8222 [2023-12-20 00:52:14,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 882 GetRequests, 794 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1658 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=800, Invalid=6172, Unknown=0, NotChecked=0, Total=6972 [2023-12-20 00:52:14,366 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 705 mSDsluCounter, 4541 mSDsCounter, 0 mSdLazyCounter, 3371 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 4765 SdHoareTripleChecker+Invalid, 3564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 3371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-20 00:52:14,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 4765 Invalid, 3564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 3371 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-20 00:52:14,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8222 states. [2023-12-20 00:52:15,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8222 to 6980. [2023-12-20 00:52:15,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6980 states, 5723 states have (on average 1.1768303337410448) internal successors, (6735), 5768 states have internal predecessors, (6735), 788 states have call successors, (788), 468 states have call predecessors, (788), 468 states have return successors, (788), 743 states have call predecessors, (788), 788 states have call successors, (788) [2023-12-20 00:52:15,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6980 states to 6980 states and 8311 transitions. [2023-12-20 00:52:15,805 INFO L78 Accepts]: Start accepts. Automaton has 6980 states and 8311 transitions. Word has length 381 [2023-12-20 00:52:15,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:52:15,805 INFO L495 AbstractCegarLoop]: Abstraction has 6980 states and 8311 transitions. [2023-12-20 00:52:15,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 7.38) internal successors, (369), 42 states have internal predecessors, (369), 14 states have call successors, (62), 11 states have call predecessors, (62), 24 states have return successors, (65), 21 states have call predecessors, (65), 14 states have call successors, (65) [2023-12-20 00:52:15,805 INFO L276 IsEmpty]: Start isEmpty. Operand 6980 states and 8311 transitions. [2023-12-20 00:52:15,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2023-12-20 00:52:15,814 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:52:15,814 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-20 00:52:15,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-12-20 00:52:16,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2023-12-20 00:52:16,023 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:52:16,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:52:16,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2086050767, now seen corresponding path program 1 times [2023-12-20 00:52:16,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:52:16,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815524824] [2023-12-20 00:52:16,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:52:16,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:52:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 00:52:16,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 00:52:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 00:52:16,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 00:52:16,219 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 00:52:16,220 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 00:52:16,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-12-20 00:52:16,223 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] [2023-12-20 00:52:16,226 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 00:52:16,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 12:52:16 BoogieIcfgContainer [2023-12-20 00:52:16,400 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 00:52:16,401 INFO L158 Benchmark]: Toolchain (without parser) took 144929.53ms. Allocated memory was 187.7MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 148.8MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 384.6MB. Max. memory is 8.0GB. [2023-12-20 00:52:16,401 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 187.7MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 00:52:16,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.52ms. Allocated memory is still 187.7MB. Free memory was 148.4MB in the beginning and 131.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-20 00:52:16,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.99ms. Allocated memory is still 187.7MB. Free memory was 131.6MB in the beginning and 128.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 00:52:16,401 INFO L158 Benchmark]: Boogie Preprocessor took 74.50ms. Allocated memory is still 187.7MB. Free memory was 128.9MB in the beginning and 125.0MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-20 00:52:16,401 INFO L158 Benchmark]: RCFGBuilder took 736.73ms. Allocated memory was 187.7MB in the beginning and 245.4MB in the end (delta: 57.7MB). Free memory was 125.0MB in the beginning and 213.9MB in the end (delta: -88.9MB). Peak memory consumption was 36.6MB. Max. memory is 8.0GB. [2023-12-20 00:52:16,401 INFO L158 Benchmark]: TraceAbstraction took 143785.34ms. Allocated memory was 245.4MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 213.4MB in the beginning and 1.2GB in the end (delta: -953.8MB). Peak memory consumption was 390.0MB. Max. memory is 8.0GB. [2023-12-20 00:52:16,405 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.10ms. Allocated memory is still 187.7MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 281.52ms. Allocated memory is still 187.7MB. Free memory was 148.4MB in the beginning and 131.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.99ms. Allocated memory is still 187.7MB. Free memory was 131.6MB in the beginning and 128.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 74.50ms. Allocated memory is still 187.7MB. Free memory was 128.9MB in the beginning and 125.0MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 736.73ms. Allocated memory was 187.7MB in the beginning and 245.4MB in the end (delta: 57.7MB). Free memory was 125.0MB in the beginning and 213.9MB in the end (delta: -88.9MB). Peak memory consumption was 36.6MB. Max. memory is 8.0GB. * TraceAbstraction took 143785.34ms. Allocated memory was 245.4MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 213.4MB in the beginning and 1.2GB in the end (delta: -953.8MB). Peak memory consumption was 390.0MB. 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: 535]: 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 ; [L36] _Bool gate1Failed ; [L37] _Bool gate2Failed ; [L38] _Bool gate3Failed ; [L39] msg_t VALUE1 ; [L40] msg_t VALUE2 ; [L41] msg_t VALUE3 ; [L43] _Bool gate1Failed_History_0 ; [L44] _Bool gate1Failed_History_1 ; [L45] _Bool gate1Failed_History_2 ; [L46] _Bool gate2Failed_History_0 ; [L47] _Bool gate2Failed_History_1 ; [L48] _Bool gate2Failed_History_2 ; [L49] _Bool gate3Failed_History_0 ; [L50] _Bool gate3Failed_History_1 ; [L51] _Bool gate3Failed_History_2 ; [L52] int8_t votedValue_History_0 ; [L53] int8_t votedValue_History_1 ; [L54] int8_t votedValue_History_2 ; [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] gate1Failed = __VERIFIER_nondet_bool() [L482] gate2Failed = __VERIFIER_nondet_bool() [L483] gate3Failed = __VERIFIER_nondet_bool() [L484] VALUE1 = __VERIFIER_nondet_char() [L485] VALUE2 = __VERIFIER_nondet_char() [L486] VALUE3 = __VERIFIER_nondet_char() [L487] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L488] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L489] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L490] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L491] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L492] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L493] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L494] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L495] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L496] votedValue_History_0 = __VERIFIER_nondet_char() [L497] votedValue_History_1 = __VERIFIER_nondet_char() [L498] votedValue_History_2 = __VERIFIER_nondet_char() [L499] CALL, EXPR init() [L203] int tmp ; [L204] int tmp___0 ; [L205] int tmp___1 ; [L206] int tmp___2 ; VAL [VALUE1=0, VALUE2=0, VALUE3=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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] CALL, EXPR add_history_type(0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] RET, EXPR add_history_type(0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] tmp = add_history_type(0) [L210] COND FALSE !(! tmp) VAL [VALUE1=0, VALUE2=0, VALUE3=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, tmp=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] CALL, EXPR add_history_type(1) VAL [VALUE1=0, VALUE2=0, VALUE3=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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] RET, EXPR add_history_type(1) VAL [VALUE1=0, VALUE2=0, VALUE3=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, nomsg=-1, tmp=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] tmp___0 = add_history_type(1) [L214] COND FALSE !(! tmp___0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, nomsg=-1, tmp=1, tmp___0=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] CALL, EXPR add_history_type(2) VAL [VALUE1=0, VALUE2=0, VALUE3=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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] RET, EXPR add_history_type(2) VAL [VALUE1=0, VALUE2=0, VALUE3=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, nomsg=-1, tmp=1, tmp___0=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] tmp___1 = add_history_type(2) [L218] COND FALSE !(! tmp___1) VAL [VALUE1=0, VALUE2=0, VALUE3=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, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] CALL, EXPR add_history_type(3) VAL [VALUE1=0, VALUE2=0, VALUE3=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, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [VALUE1=0, VALUE2=0, VALUE3=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, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \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, votedValue_History_1=0, votedValue_History_2=0] [L221] RET, EXPR add_history_type(3) VAL [VALUE1=0, VALUE2=0, VALUE3=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, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] tmp___2 = add_history_type(3) [L222] COND FALSE !(! tmp___2) [L225] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=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, 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, votedValue_History_1=0, votedValue_History_2=0] [L499] RET, EXPR init() [L499] i2 = init() [L500] COND FALSE !(!(i2)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, 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, votedValue_History_1=0, votedValue_History_2=0] [L501] g1v_old = nomsg [L502] g1v_new = nomsg [L503] g2v_old = nomsg [L504] g2v_new = nomsg [L505] g3v_old = nomsg [L506] g3v_new = nomsg [L507] i2 = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, 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, votedValue_History_1=0, votedValue_History_2=0] [L508] COND TRUE i2 < 10 [L510] CALL gate1_each_pals_period() [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L344] CALL write_history_bool(0, gate1Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=7, \old(gate1Failed_History_2)=5, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=3, \old(gate2Failed_History_2)=2, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \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=1, gate1Failed_History_0=0, gate1Failed_History_1=7, gate1Failed_History_2=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=2, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] gate1Failed_History_0 = buf VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=7, \old(gate1Failed_History_2)=5, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=3, \old(gate2Failed_History_2)=2, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=6, \old(history_id)=0, buf=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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=2, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, history_id=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L344] RET write_history_bool(0, gate1Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=2, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L345] COND TRUE \read(gate1Failed) [L346] g1v_new = nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new VAL [VALUE1=0, VALUE2=0, VALUE3=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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=2, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L510] RET gate1_each_pals_period() [L511] CALL gate2_each_pals_period() [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L375] CALL write_history_bool(1, gate2Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=3, \old(gate2Failed_History_2)=2, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=2, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=3, \old(gate2Failed_History_2)=2, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=6, \old(history_id)=1, buf=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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=2, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] gate2Failed_History_0 = buf VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=3, \old(gate2Failed_History_2)=2, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=6, \old(history_id)=1, buf=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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L375] RET write_history_bool(1, gate2Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L376] COND TRUE \read(gate2Failed) [L377] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [VALUE1=0, VALUE2=0, VALUE3=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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L511] RET gate2_each_pals_period() [L512] CALL gate3_each_pals_period() [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L406] CALL write_history_bool(2, gate3Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=6, \old(history_id)=2, 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=6, \old(history_id)=2, 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L186] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=6, \old(history_id)=2, 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_History_0 = buf VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=6, \old(history_id)=2, 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L406] RET write_history_bool(2, gate3Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L407] COND FALSE !(\read(gate3Failed)) [L411] tmp = __VERIFIER_nondet_char() [L412] next_state = tmp VAL [VALUE1=0, VALUE2=0, VALUE3=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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L413] COND TRUE (int )next_state == 0 [L414] tmp___0 = 1 VAL [VALUE1=0, VALUE2=0, VALUE3=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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L424] COND FALSE !(!((_Bool )tmp___0)) VAL [VALUE1=0, VALUE2=0, VALUE3=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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L425] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L512] RET gate3_each_pals_period() [L513] CALL voter() [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] g3v_old = nomsg VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0, voted_value=-1] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 [L442] voted_value = VALUE1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0, voted_value=-1] [L470] CALL write_history_int8(3, voted_value) [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] 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=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L470] RET write_history_int8(3, voted_value) [L513] RET voter() [L514] g1v_old = g1v_new [L515] g1v_new = nomsg [L516] g2v_old = g2v_new [L517] g2v_new = nomsg [L518] g3v_old = g3v_new [L519] g3v_new = nomsg [L520] CALL, EXPR check() [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L249] COND FALSE !(! gate1Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L252] COND FALSE !(! gate2Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L255] COND TRUE ! gate3Failed [L256] tmp = 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L260] COND FALSE !(!((_Bool )tmp)) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L127] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L130] COND TRUE historyIndex == 1 [L131] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] tmp___3 = read_history_bool(0, 1) [L262] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, tmp=1, tmp___3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L136] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L137] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L140] COND TRUE historyIndex == 1 [L141] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, tmp=1, tmp___3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] tmp___4 = read_history_bool(1, 1) [L264] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, tmp=1, tmp___3=0, tmp___4=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L136] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L146] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L147] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L150] COND TRUE historyIndex == 1 [L151] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, tmp=1, tmp___3=0, tmp___4=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] tmp___5 = read_history_bool(2, 1) [L266] COND TRUE ! tmp___5 [L267] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, 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=0] [L268] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, 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=0] [L268] tmp___0 = read_history_int8(3, 0) [L269] COND TRUE (int )VALUE1 == (int )tmp___0 [L270] temp_count ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, 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=0] [L272] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, 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=0] [L272] tmp___1 = read_history_int8(3, 0) [L273] COND TRUE (int )VALUE2 == (int )tmp___1 [L274] temp_count ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, 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=0] [L276] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, 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=0] [L276] tmp___2 = read_history_int8(3, 0) [L277] COND TRUE (int )VALUE3 == (int )tmp___2 [L278] temp_count ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, 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=0] [L280] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, 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=0] [L294] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, 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=0] [L300] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND TRUE historyIndex == 1 [L111] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, 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=0] [L300] tmp___10 = read_history_int8(3, 1) [L301] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, 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=0] [L320] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, 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=0] [L320] tmp___11 = read_history_int8(3, 0) [L321] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, 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=0] [L333] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, 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=0] [L520] RET, EXPR check() [L520] c1 = check() [L521] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L533] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L521] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, i2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L522] i2 ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, c1=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, i2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L508] COND TRUE i2 < 10 [L510] CALL gate1_each_pals_period() [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L344] CALL write_history_bool(0, gate1Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \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=0, gate1Failed=0, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] gate1Failed_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L344] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L345] COND FALSE !(\read(gate1Failed)) [L349] tmp = __VERIFIER_nondet_char() [L350] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L351] COND TRUE (int )next_state == 0 [L352] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L362] COND FALSE !(!((_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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L363] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L510] RET gate1_each_pals_period() [L511] CALL gate2_each_pals_period() [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L375] CALL write_history_bool(1, gate2Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=1, 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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] gate2Failed_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=1, 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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L375] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L376] COND TRUE \read(gate2Failed) [L377] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L511] RET gate2_each_pals_period() [L512] CALL gate3_each_pals_period() [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L406] CALL write_history_bool(2, gate3Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=2, 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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L186] COND FALSE !(history_id == 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=2, 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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=2, 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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L406] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L407] COND TRUE \read(gate3Failed) [L408] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L512] RET gate3_each_pals_period() [L513] CALL voter() [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] g3v_old = nomsg VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0, voted_value=-1] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 [L442] voted_value = VALUE1 VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0, voted_value=-1] [L470] CALL write_history_int8(3, voted_value) [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] votedValue_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, 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] [L470] RET write_history_int8(3, voted_value) [L513] RET voter() [L514] g1v_old = g1v_new [L515] g1v_new = nomsg [L516] g2v_old = g2v_new [L517] g2v_new = nomsg [L518] g3v_old = g3v_new [L519] g3v_new = nomsg [L520] CALL, EXPR check() [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] int8_t tmp___14 ; VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L249] COND TRUE ! gate1Failed [L250] tmp = 1 VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L260] COND FALSE !(!((_Bool )tmp)) VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] CALL, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND TRUE history_id == 0 VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, 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] [L127] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, 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 TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, \result=-511, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, 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] [L261] RET, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND FALSE !(! tmp___3) VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] CALL, EXPR read_history_int8(3, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND TRUE historyIndex == 1 [L111] return (votedValue_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] RET, EXPR read_history_int8(3, 1) VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] tmp___10 = read_history_int8(3, 1) [L301] COND TRUE (int )tmp___10 > -2 VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, 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] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, 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] [L302] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] tmp___6 = read_history_int8(3, 0) [L303] COND TRUE (int )tmp___6 == (int )nomsg VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] CALL, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND TRUE history_id == 0 VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, 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] [L127] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, 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 TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, \result=-511, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, 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] [L304] RET, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] tmp___7 = read_history_bool(0, 1) [L305] COND TRUE \read(tmp___7) VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] CALL, EXPR read_history_bool(1, 1) VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, 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] [L136] COND TRUE history_id == 1 VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, 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] [L137] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, 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 TRUE historyIndex == 1 [L141] return (gate2Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, \result=-255, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, 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] [L306] RET, EXPR read_history_bool(1, 1) VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] tmp___8 = read_history_bool(1, 1) [L307] COND TRUE \read(tmp___8) VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] CALL, EXPR read_history_bool(2, 1) VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, 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] [L136] COND FALSE !(history_id == 1) VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, 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] [L146] COND TRUE history_id == 2 VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, 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] [L147] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, 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 TRUE historyIndex == 1 [L151] return (gate3Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, 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] [L308] RET, EXPR read_history_bool(2, 1) VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] tmp___9 = read_history_bool(2, 1) [L309] COND TRUE ! tmp___9 [L310] return (0); VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, tmp___9=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L520] RET, EXPR check() [L520] c1 = check() [L521] CALL assert(c1) VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L533] COND TRUE ! arg VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L535] reach_error() VAL [VALUE1=-1, VALUE2=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, 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 6 procedures, 171 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 143.6s, OverallIterations: 48, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 106.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33238 SdHoareTripleChecker+Valid, 33.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32889 mSDsluCounter, 108174 SdHoareTripleChecker+Invalid, 28.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94635 mSDsCounter, 8822 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69382 IncrementalHoareTripleChecker+Invalid, 78204 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8822 mSolverCounterUnsat, 13539 mSDtfsCounter, 69382 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11969 GetRequests, 10001 SyntacticMatches, 30 SemanticMatches, 1938 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247635 ImplicationChecksByTransitivity, 56.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11622occurred in iteration=43, InterpolantAutomatonStates: 1758, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.2s AutomataMinimizationTime, 47 MinimizatonAttempts, 54327 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 17.0s InterpolantComputationTime, 16326 NumberOfCodeBlocks, 16326 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 18466 ConstructedInterpolants, 0 QuantifiedInterpolants, 39367 SizeOfPredicates, 72 NumberOfNonLiveVariables, 19240 ConjunctsInSsa, 369 ConjunctsInUnsatCore, 76 InterpolantComputations, 39 PerfectInterpolantSequences, 45379/47891 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-20 00:52:16,422 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...