/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 11:24:08,930 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 11:24:08,967 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-21 11:24:08,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 11:24:08,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 11:24:08,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 11:24:08,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 11:24:08,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 11:24:08,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 11:24:08,986 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 11:24:08,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 11:24:08,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 11:24:08,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 11:24:08,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 11:24:08,987 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 11:24:08,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 11:24:08,988 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 11:24:08,988 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 11:24:08,988 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 11:24:08,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 11:24:08,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 11:24:08,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 11:24:08,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 11:24:08,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 11:24:08,990 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 11:24:08,990 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 11:24:08,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 11:24:08,990 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 11:24:08,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 11:24:08,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 11:24:08,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 11:24:08,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 11:24:08,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 11:24:08,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 11:24:08,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 11:24:08,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 11:24:08,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 11:24:08,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 11:24:08,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 11:24:08,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 11:24:08,993 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 11:24:08,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 11:24:08,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 11:24:08,993 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 -> false [2023-12-21 11:24:09,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 11:24:09,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 11:24:09,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 11:24:09,143 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 11:24:09,143 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 11:24:09,144 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.UNBOUNDED.pals.c [2023-12-21 11:24:10,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 11:24:10,479 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 11:24:10,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2023-12-21 11:24:10,488 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df8b86008/50cf53141a974af38b645ce57d6badc7/FLAG7ecbf7845 [2023-12-21 11:24:10,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df8b86008/50cf53141a974af38b645ce57d6badc7 [2023-12-21 11:24:10,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 11:24:10,508 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 11:24:10,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 11:24:10,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 11:24:10,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 11:24:10,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:24:10" (1/1) ... [2023-12-21 11:24:10,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556ab1f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:10, skipping insertion in model container [2023-12-21 11:24:10,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:24:10" (1/1) ... [2023-12-21 11:24:10,544 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 11:24:10,730 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.UNBOUNDED.pals.c[12020,12033] [2023-12-21 11:24:10,735 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 11:24:10,743 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 11:24:10,804 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.UNBOUNDED.pals.c[12020,12033] [2023-12-21 11:24:10,804 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 11:24:10,815 INFO L206 MainTranslator]: Completed translation [2023-12-21 11:24:10,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:10 WrapperNode [2023-12-21 11:24:10,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 11:24:10,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 11:24:10,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 11:24:10,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 11:24:10,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:10" (1/1) ... [2023-12-21 11:24:10,830 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:10" (1/1) ... [2023-12-21 11:24:10,857 INFO L138 Inliner]: procedures = 28, calls = 51, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 404 [2023-12-21 11:24:10,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 11:24:10,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 11:24:10,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 11:24:10,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 11:24:10,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:10" (1/1) ... [2023-12-21 11:24:10,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:10" (1/1) ... [2023-12-21 11:24:10,877 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:10" (1/1) ... [2023-12-21 11:24:10,895 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-21 11:24:10,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:10" (1/1) ... [2023-12-21 11:24:10,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:10" (1/1) ... [2023-12-21 11:24:10,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:10" (1/1) ... [2023-12-21 11:24:10,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:10" (1/1) ... [2023-12-21 11:24:10,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:10" (1/1) ... [2023-12-21 11:24:10,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:10" (1/1) ... [2023-12-21 11:24:10,912 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 11:24:10,912 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 11:24:10,912 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 11:24:10,912 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 11:24:10,913 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:10" (1/1) ... [2023-12-21 11:24:10,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 11:24:10,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:10,994 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 11:24:11,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 11:24:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 11:24:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2023-12-21 11:24:11,023 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2023-12-21 11:24:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2023-12-21 11:24:11,024 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2023-12-21 11:24:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2023-12-21 11:24:11,025 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2023-12-21 11:24:11,026 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2023-12-21 11:24:11,026 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2023-12-21 11:24:11,026 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2023-12-21 11:24:11,026 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2023-12-21 11:24:11,026 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 11:24:11,026 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 11:24:11,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 11:24:11,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 11:24:11,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 11:24:11,100 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 11:24:11,101 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 11:24:11,486 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 11:24:11,511 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 11:24:11,511 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-21 11:24:11,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:24:11 BoogieIcfgContainer [2023-12-21 11:24:11,512 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 11:24:11,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 11:24:11,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 11:24:11,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 11:24:11,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 11:24:10" (1/3) ... [2023-12-21 11:24:11,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ca7010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:24:11, skipping insertion in model container [2023-12-21 11:24:11,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:10" (2/3) ... [2023-12-21 11:24:11,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ca7010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:24:11, skipping insertion in model container [2023-12-21 11:24:11,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:24:11" (3/3) ... [2023-12-21 11:24:11,518 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2023-12-21 11:24:11,530 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 11:24:11,530 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 11:24:11,564 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 11:24:11,569 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;@20267e2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 11:24:11,569 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 11:24:11,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 174 states, 129 states have (on average 1.6046511627906976) internal successors, (207), 134 states have internal predecessors, (207), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2023-12-21 11:24:11,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-21 11:24:11,579 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:11,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:11,580 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:11,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:11,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1165195423, now seen corresponding path program 1 times [2023-12-21 11:24:11,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:11,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864605429] [2023-12-21 11:24:11,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:11,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:24:11,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:11,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864605429] [2023-12-21 11:24:11,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864605429] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:11,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:11,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:11,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731281575] [2023-12-21 11:24:11,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:11,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:11,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:11,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:11,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:11,816 INFO L87 Difference]: Start difference. First operand has 174 states, 129 states have (on average 1.6046511627906976) internal successors, (207), 134 states have internal predecessors, (207), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:24:11,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:11,948 INFO L93 Difference]: Finished difference Result 352 states and 610 transitions. [2023-12-21 11:24:11,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:11,962 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-21 11:24:11,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:11,973 INFO L225 Difference]: With dead ends: 352 [2023-12-21 11:24:11,973 INFO L226 Difference]: Without dead ends: 180 [2023-12-21 11:24:11,981 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-21 11:24:11,984 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 18 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:11,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 787 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:11,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-12-21 11:24:12,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2023-12-21 11:24:12,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 133 states have (on average 1.5639097744360901) internal successors, (208), 137 states have internal predecessors, (208), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2023-12-21 11:24:12,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 282 transitions. [2023-12-21 11:24:12,025 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 282 transitions. Word has length 14 [2023-12-21 11:24:12,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:12,025 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 282 transitions. [2023-12-21 11:24:12,026 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-21 11:24:12,026 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 282 transitions. [2023-12-21 11:24:12,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 11:24:12,027 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:12,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:12,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 11:24:12,028 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:12,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:12,028 INFO L85 PathProgramCache]: Analyzing trace with hash 579778909, now seen corresponding path program 1 times [2023-12-21 11:24:12,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:12,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336268465] [2023-12-21 11:24:12,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:12,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:24:12,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:12,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336268465] [2023-12-21 11:24:12,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336268465] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:12,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:12,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:12,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144261218] [2023-12-21 11:24:12,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:12,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:12,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:12,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:12,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:12,075 INFO L87 Difference]: Start difference. First operand 178 states and 282 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-21 11:24:12,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:12,114 INFO L93 Difference]: Finished difference Result 370 states and 588 transitions. [2023-12-21 11:24:12,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:12,114 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-21 11:24:12,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:12,116 INFO L225 Difference]: With dead ends: 370 [2023-12-21 11:24:12,116 INFO L226 Difference]: Without dead ends: 194 [2023-12-21 11:24:12,117 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-21 11:24:12,118 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 25 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 807 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-21 11:24:12,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 807 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:12,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-12-21 11:24:12,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2023-12-21 11:24:12,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 144 states have (on average 1.5416666666666667) internal successors, (222), 148 states have internal predecessors, (222), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-21 11:24:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 298 transitions. [2023-12-21 11:24:12,132 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 298 transitions. Word has length 15 [2023-12-21 11:24:12,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:12,132 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 298 transitions. [2023-12-21 11:24:12,132 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-21 11:24:12,133 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 298 transitions. [2023-12-21 11:24:12,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-21 11:24:12,134 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:12,134 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:12,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 11:24:12,134 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:12,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:12,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1957244647, now seen corresponding path program 1 times [2023-12-21 11:24:12,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:12,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631712206] [2023-12-21 11:24:12,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:12,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:24:12,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:12,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631712206] [2023-12-21 11:24:12,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631712206] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:12,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:12,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 11:24:12,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17448475] [2023-12-21 11:24:12,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:12,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:24:12,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:12,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:24:12,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:24:12,182 INFO L87 Difference]: Start difference. First operand 191 states and 298 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 11:24:12,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:12,200 INFO L93 Difference]: Finished difference Result 402 states and 634 transitions. [2023-12-21 11:24:12,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:24:12,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2023-12-21 11:24:12,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:12,202 INFO L225 Difference]: With dead ends: 402 [2023-12-21 11:24:12,202 INFO L226 Difference]: Without dead ends: 220 [2023-12-21 11:24:12,203 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-21 11:24:12,204 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 22 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 542 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-21 11:24:12,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 542 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:12,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-12-21 11:24:12,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 193. [2023-12-21 11:24:12,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 146 states have (on average 1.5342465753424657) internal successors, (224), 150 states have internal predecessors, (224), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-21 11:24:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 300 transitions. [2023-12-21 11:24:12,216 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 300 transitions. Word has length 23 [2023-12-21 11:24:12,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:12,217 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 300 transitions. [2023-12-21 11:24:12,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 11:24:12,217 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 300 transitions. [2023-12-21 11:24:12,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-21 11:24:12,218 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:12,218 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:12,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 11:24:12,218 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:12,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:12,219 INFO L85 PathProgramCache]: Analyzing trace with hash 784621896, now seen corresponding path program 1 times [2023-12-21 11:24:12,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:12,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184002132] [2023-12-21 11:24:12,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:12,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:24:12,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:12,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184002132] [2023-12-21 11:24:12,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184002132] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:12,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:12,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:24:12,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093635610] [2023-12-21 11:24:12,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:12,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:24:12,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:12,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:24:12,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:12,304 INFO L87 Difference]: Start difference. First operand 193 states and 300 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-21 11:24:12,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:12,349 INFO L93 Difference]: Finished difference Result 378 states and 591 transitions. [2023-12-21 11:24:12,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:12,349 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-21 11:24:12,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:12,351 INFO L225 Difference]: With dead ends: 378 [2023-12-21 11:24:12,351 INFO L226 Difference]: Without dead ends: 200 [2023-12-21 11:24:12,355 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-21 11:24:12,359 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 1 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:12,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1080 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:12,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-12-21 11:24:12,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2023-12-21 11:24:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 149 states have (on average 1.523489932885906) internal successors, (227), 153 states have internal predecessors, (227), 38 states have call successors, (38), 8 states have call predecessors, (38), 9 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2023-12-21 11:24:12,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 304 transitions. [2023-12-21 11:24:12,371 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 304 transitions. Word has length 31 [2023-12-21 11:24:12,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:12,371 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 304 transitions. [2023-12-21 11:24:12,371 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-21 11:24:12,371 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 304 transitions. [2023-12-21 11:24:12,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 11:24:12,373 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:12,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:12,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 11:24:12,373 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:12,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:12,373 INFO L85 PathProgramCache]: Analyzing trace with hash -64301629, now seen corresponding path program 1 times [2023-12-21 11:24:12,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:12,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134066863] [2023-12-21 11:24:12,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:12,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 11:24:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:24:12,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:12,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134066863] [2023-12-21 11:24:12,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134066863] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:12,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:12,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 11:24:12,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742164169] [2023-12-21 11:24:12,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:12,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 11:24:12,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:12,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 11:24:12,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:24:12,492 INFO L87 Difference]: Start difference. First operand 197 states and 304 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 11:24:12,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:12,566 INFO L93 Difference]: Finished difference Result 340 states and 531 transitions. [2023-12-21 11:24:12,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 11:24:12,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2023-12-21 11:24:12,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:12,570 INFO L225 Difference]: With dead ends: 340 [2023-12-21 11:24:12,570 INFO L226 Difference]: Without dead ends: 193 [2023-12-21 11:24:12,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-21 11:24:12,573 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 117 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:12,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1176 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:12,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-12-21 11:24:12,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2023-12-21 11:24:12,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 146 states have (on average 1.5) internal successors, (219), 150 states have internal predecessors, (219), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-21 11:24:12,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 295 transitions. [2023-12-21 11:24:12,624 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 295 transitions. Word has length 34 [2023-12-21 11:24:12,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:12,625 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 295 transitions. [2023-12-21 11:24:12,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 11:24:12,625 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 295 transitions. [2023-12-21 11:24:12,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 11:24:12,626 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:12,626 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:12,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 11:24:12,627 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:12,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:12,627 INFO L85 PathProgramCache]: Analyzing trace with hash 972312280, now seen corresponding path program 1 times [2023-12-21 11:24:12,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:12,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052900479] [2023-12-21 11:24:12,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:12,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:24:12,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:12,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052900479] [2023-12-21 11:24:12,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052900479] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:12,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709341447] [2023-12-21 11:24:12,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:12,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:12,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:12,723 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-21 11:24:12,737 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-21 11:24:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 11:24:12,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:12,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:24:12,850 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:24:12,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:24:12,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709341447] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:24:12,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:24:12,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-12-21 11:24:12,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273521846] [2023-12-21 11:24:12,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:24:12,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:24:12,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:12,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:24:12,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:12,890 INFO L87 Difference]: Start difference. First operand 193 states and 295 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-21 11:24:12,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:12,926 INFO L93 Difference]: Finished difference Result 435 states and 678 transitions. [2023-12-21 11:24:12,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:12,927 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-21 11:24:12,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:12,928 INFO L225 Difference]: With dead ends: 435 [2023-12-21 11:24:12,929 INFO L226 Difference]: Without dead ends: 252 [2023-12-21 11:24:12,929 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-21 11:24:12,931 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 91 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:12,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 555 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-12-21 11:24:12,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 246. [2023-12-21 11:24:12,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 189 states have (on average 1.470899470899471) internal successors, (278), 193 states have internal predecessors, (278), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-21 11:24:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 374 transitions. [2023-12-21 11:24:12,949 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 374 transitions. Word has length 34 [2023-12-21 11:24:12,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:12,950 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 374 transitions. [2023-12-21 11:24:12,950 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-21 11:24:12,950 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 374 transitions. [2023-12-21 11:24:12,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-21 11:24:12,952 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:12,952 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-21 11:24:12,959 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-21 11:24:13,156 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-21 11:24:13,157 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:13,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:13,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1882466360, now seen corresponding path program 2 times [2023-12-21 11:24:13,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:13,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178172837] [2023-12-21 11:24:13,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:13,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,200 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-21 11:24:13,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:13,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178172837] [2023-12-21 11:24:13,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178172837] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:13,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:13,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:13,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63993023] [2023-12-21 11:24:13,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:13,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:13,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:13,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:13,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:13,201 INFO L87 Difference]: Start difference. First operand 246 states and 374 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-21 11:24:13,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:13,235 INFO L93 Difference]: Finished difference Result 503 states and 775 transitions. [2023-12-21 11:24:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:13,235 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-21 11:24:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:13,237 INFO L225 Difference]: With dead ends: 503 [2023-12-21 11:24:13,237 INFO L226 Difference]: Without dead ends: 285 [2023-12-21 11:24:13,237 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-21 11:24:13,238 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 24 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 799 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-21 11:24:13,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 799 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:13,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-12-21 11:24:13,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2023-12-21 11:24:13,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 221 states have (on average 1.4253393665158371) internal successors, (315), 225 states have internal predecessors, (315), 51 states have call successors, (51), 9 states have call predecessors, (51), 9 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2023-12-21 11:24:13,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 417 transitions. [2023-12-21 11:24:13,248 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 417 transitions. Word has length 56 [2023-12-21 11:24:13,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:13,248 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 417 transitions. [2023-12-21 11:24:13,248 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-21 11:24:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 417 transitions. [2023-12-21 11:24:13,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-21 11:24:13,249 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:13,249 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-21 11:24:13,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 11:24:13,249 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:13,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:13,250 INFO L85 PathProgramCache]: Analyzing trace with hash 431791273, now seen corresponding path program 1 times [2023-12-21 11:24:13,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:13,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43269030] [2023-12-21 11:24:13,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:13,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,293 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-21 11:24:13,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:13,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43269030] [2023-12-21 11:24:13,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43269030] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:13,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:13,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:13,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60043366] [2023-12-21 11:24:13,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:13,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:13,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:13,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:13,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:13,298 INFO L87 Difference]: Start difference. First operand 282 states and 417 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-21 11:24:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:13,335 INFO L93 Difference]: Finished difference Result 540 states and 822 transitions. [2023-12-21 11:24:13,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:13,336 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-21 11:24:13,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:13,337 INFO L225 Difference]: With dead ends: 540 [2023-12-21 11:24:13,337 INFO L226 Difference]: Without dead ends: 291 [2023-12-21 11:24:13,338 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-21 11:24:13,339 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 19 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 786 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-21 11:24:13,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 786 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:13,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2023-12-21 11:24:13,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2023-12-21 11:24:13,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 227 states have (on average 1.422907488986784) internal successors, (323), 231 states have internal predecessors, (323), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2023-12-21 11:24:13,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 425 transitions. [2023-12-21 11:24:13,354 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 425 transitions. Word has length 56 [2023-12-21 11:24:13,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:13,355 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 425 transitions. [2023-12-21 11:24:13,355 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-21 11:24:13,355 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 425 transitions. [2023-12-21 11:24:13,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-21 11:24:13,356 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:13,356 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-21 11:24:13,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 11:24:13,356 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:13,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:13,356 INFO L85 PathProgramCache]: Analyzing trace with hash -349947768, now seen corresponding path program 1 times [2023-12-21 11:24:13,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:13,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359513590] [2023-12-21 11:24:13,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:13,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,444 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-21 11:24:13,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:13,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359513590] [2023-12-21 11:24:13,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359513590] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:13,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:13,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:24:13,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123470716] [2023-12-21 11:24:13,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:13,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:24:13,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:13,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:24:13,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:13,445 INFO L87 Difference]: Start difference. First operand 289 states and 425 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-21 11:24:13,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:13,472 INFO L93 Difference]: Finished difference Result 528 states and 790 transitions. [2023-12-21 11:24:13,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:13,472 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-21 11:24:13,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:13,475 INFO L225 Difference]: With dead ends: 528 [2023-12-21 11:24:13,475 INFO L226 Difference]: Without dead ends: 291 [2023-12-21 11:24:13,476 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-21 11:24:13,478 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1067 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-21 11:24:13,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1067 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:13,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2023-12-21 11:24:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2023-12-21 11:24:13,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 227 states have (on average 1.4096916299559472) internal successors, (320), 231 states have internal predecessors, (320), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2023-12-21 11:24:13,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 422 transitions. [2023-12-21 11:24:13,490 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 422 transitions. Word has length 74 [2023-12-21 11:24:13,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:13,490 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 422 transitions. [2023-12-21 11:24:13,490 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-21 11:24:13,490 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 422 transitions. [2023-12-21 11:24:13,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-21 11:24:13,492 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:13,492 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-21 11:24:13,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 11:24:13,492 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:13,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:13,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1852005032, now seen corresponding path program 1 times [2023-12-21 11:24:13,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:13,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263916241] [2023-12-21 11:24:13,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:13,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,606 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-21 11:24:13,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:13,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263916241] [2023-12-21 11:24:13,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263916241] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:13,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:13,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:13,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820448931] [2023-12-21 11:24:13,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:13,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:13,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:13,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:13,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:13,608 INFO L87 Difference]: Start difference. First operand 289 states and 422 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-21 11:24:13,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:13,645 INFO L93 Difference]: Finished difference Result 565 states and 846 transitions. [2023-12-21 11:24:13,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:13,646 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-21 11:24:13,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:13,647 INFO L225 Difference]: With dead ends: 565 [2023-12-21 11:24:13,647 INFO L226 Difference]: Without dead ends: 333 [2023-12-21 11:24:13,648 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-21 11:24:13,649 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 25 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 799 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-21 11:24:13,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 799 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:13,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-12-21 11:24:13,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2023-12-21 11:24:13,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 264 states have (on average 1.371212121212121) internal successors, (362), 268 states have internal predecessors, (362), 54 states have call successors, (54), 11 states have call predecessors, (54), 11 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-21 11:24:13,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 470 transitions. [2023-12-21 11:24:13,660 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 470 transitions. Word has length 103 [2023-12-21 11:24:13,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:13,660 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 470 transitions. [2023-12-21 11:24:13,660 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-21 11:24:13,660 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 470 transitions. [2023-12-21 11:24:13,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-21 11:24:13,661 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:13,661 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-21 11:24:13,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 11:24:13,661 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:13,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:13,661 INFO L85 PathProgramCache]: Analyzing trace with hash 497991807, now seen corresponding path program 1 times [2023-12-21 11:24:13,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:13,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272389676] [2023-12-21 11:24:13,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:13,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,722 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-21 11:24:13,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:13,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272389676] [2023-12-21 11:24:13,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272389676] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:13,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:13,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:13,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706260425] [2023-12-21 11:24:13,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:13,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:13,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:13,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:13,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:13,724 INFO L87 Difference]: Start difference. First operand 330 states and 470 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-21 11:24:13,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:13,782 INFO L93 Difference]: Finished difference Result 591 states and 866 transitions. [2023-12-21 11:24:13,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:24:13,782 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-21 11:24:13,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:13,784 INFO L225 Difference]: With dead ends: 591 [2023-12-21 11:24:13,784 INFO L226 Difference]: Without dead ends: 324 [2023-12-21 11:24:13,784 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-21 11:24:13,785 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 15 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 759 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-21 11:24:13,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 759 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:13,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2023-12-21 11:24:13,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2023-12-21 11:24:13,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 259 states have (on average 1.3513513513513513) internal successors, (350), 263 states have internal predecessors, (350), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-21 11:24:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 456 transitions. [2023-12-21 11:24:13,798 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 456 transitions. Word has length 104 [2023-12-21 11:24:13,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:13,800 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 456 transitions. [2023-12-21 11:24:13,800 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-21 11:24:13,801 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 456 transitions. [2023-12-21 11:24:13,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-21 11:24:13,801 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:13,801 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-21 11:24:13,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 11:24:13,802 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:13,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:13,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1261568454, now seen corresponding path program 1 times [2023-12-21 11:24:13,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:13,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328309394] [2023-12-21 11:24:13,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:13,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,893 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-21 11:24:13,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:13,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328309394] [2023-12-21 11:24:13,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328309394] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:13,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:13,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:24:13,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910290443] [2023-12-21 11:24:13,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:13,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:24:13,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:13,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:24:13,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:13,895 INFO L87 Difference]: Start difference. First operand 324 states and 456 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-21 11:24:13,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:13,919 INFO L93 Difference]: Finished difference Result 566 states and 815 transitions. [2023-12-21 11:24:13,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:13,919 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-21 11:24:13,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:13,922 INFO L225 Difference]: With dead ends: 566 [2023-12-21 11:24:13,922 INFO L226 Difference]: Without dead ends: 326 [2023-12-21 11:24:13,923 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-21 11:24:13,923 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 0 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1051 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-21 11:24:13,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1051 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:13,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2023-12-21 11:24:13,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2023-12-21 11:24:13,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 259 states have (on average 1.3397683397683398) internal successors, (347), 263 states have internal predecessors, (347), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-21 11:24:13,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 453 transitions. [2023-12-21 11:24:13,936 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 453 transitions. Word has length 123 [2023-12-21 11:24:13,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:13,936 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 453 transitions. [2023-12-21 11:24:13,936 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-21 11:24:13,936 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 453 transitions. [2023-12-21 11:24:13,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-21 11:24:13,937 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:13,937 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-21 11:24:13,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 11:24:13,937 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:13,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:13,938 INFO L85 PathProgramCache]: Analyzing trace with hash -25377946, now seen corresponding path program 1 times [2023-12-21 11:24:13,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:13,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689509637] [2023-12-21 11:24:13,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:13,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,048 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-21 11:24:14,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:14,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689509637] [2023-12-21 11:24:14,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689509637] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:14,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:14,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:14,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452832355] [2023-12-21 11:24:14,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:14,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:14,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:14,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:14,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:14,050 INFO L87 Difference]: Start difference. First operand 324 states and 453 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-21 11:24:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:14,094 INFO L93 Difference]: Finished difference Result 529 states and 775 transitions. [2023-12-21 11:24:14,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:24:14,095 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-21 11:24:14,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:14,097 INFO L225 Difference]: With dead ends: 529 [2023-12-21 11:24:14,097 INFO L226 Difference]: Without dead ends: 322 [2023-12-21 11:24:14,097 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-21 11:24:14,098 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 13 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 727 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-21 11:24:14,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 727 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:14,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-12-21 11:24:14,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2023-12-21 11:24:14,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 258 states have (on average 1.3372093023255813) internal successors, (345), 262 states have internal predecessors, (345), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-21 11:24:14,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 449 transitions. [2023-12-21 11:24:14,108 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 449 transitions. Word has length 156 [2023-12-21 11:24:14,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:14,109 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 449 transitions. [2023-12-21 11:24:14,109 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-21 11:24:14,109 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 449 transitions. [2023-12-21 11:24:14,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-21 11:24:14,110 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:14,110 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:14,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 11:24:14,111 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:14,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:14,111 INFO L85 PathProgramCache]: Analyzing trace with hash -93490958, now seen corresponding path program 1 times [2023-12-21 11:24:14,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:14,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079157378] [2023-12-21 11:24:14,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:14,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-12-21 11:24:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,203 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-21 11:24:14,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:14,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079157378] [2023-12-21 11:24:14,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079157378] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:14,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:14,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:14,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370351178] [2023-12-21 11:24:14,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:14,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:14,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:14,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:14,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:14,205 INFO L87 Difference]: Start difference. First operand 322 states and 449 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-21 11:24:14,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:14,248 INFO L93 Difference]: Finished difference Result 469 states and 671 transitions. [2023-12-21 11:24:14,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:14,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 175 [2023-12-21 11:24:14,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:14,250 INFO L225 Difference]: With dead ends: 469 [2023-12-21 11:24:14,250 INFO L226 Difference]: Without dead ends: 305 [2023-12-21 11:24:14,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-21 11:24:14,251 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 35 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 708 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-21 11:24:14,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 708 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:14,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-12-21 11:24:14,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2023-12-21 11:24:14,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 244 states have (on average 1.3278688524590163) internal successors, (324), 248 states have internal predecessors, (324), 49 states have call successors, (49), 11 states have call predecessors, (49), 11 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2023-12-21 11:24:14,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 422 transitions. [2023-12-21 11:24:14,261 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 422 transitions. Word has length 175 [2023-12-21 11:24:14,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:14,262 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 422 transitions. [2023-12-21 11:24:14,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-21 11:24:14,262 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 422 transitions. [2023-12-21 11:24:14,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-12-21 11:24:14,263 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:14,263 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:14,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-21 11:24:14,264 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:14,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:14,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1448764403, now seen corresponding path program 1 times [2023-12-21 11:24:14,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:14,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974343508] [2023-12-21 11:24:14,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:14,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-12-21 11:24:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,376 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-21 11:24:14,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:14,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974343508] [2023-12-21 11:24:14,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974343508] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:14,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:14,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:14,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253297880] [2023-12-21 11:24:14,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:14,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:14,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:14,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:14,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:14,379 INFO L87 Difference]: Start difference. First operand 305 states and 422 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-21 11:24:14,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:14,425 INFO L93 Difference]: Finished difference Result 452 states and 644 transitions. [2023-12-21 11:24:14,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:14,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 177 [2023-12-21 11:24:14,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:14,427 INFO L225 Difference]: With dead ends: 452 [2023-12-21 11:24:14,427 INFO L226 Difference]: Without dead ends: 286 [2023-12-21 11:24:14,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-21 11:24:14,429 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 30 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 712 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-21 11:24:14,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 712 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:14,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-12-21 11:24:14,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2023-12-21 11:24:14,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 228 states have (on average 1.3201754385964912) internal successors, (301), 232 states have internal predecessors, (301), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 11:24:14,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 393 transitions. [2023-12-21 11:24:14,439 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 393 transitions. Word has length 177 [2023-12-21 11:24:14,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:14,440 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 393 transitions. [2023-12-21 11:24:14,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-21 11:24:14,440 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 393 transitions. [2023-12-21 11:24:14,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-12-21 11:24:14,441 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:14,441 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:14,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 11:24:14,441 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:14,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:14,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1265191700, now seen corresponding path program 1 times [2023-12-21 11:24:14,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:14,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726589634] [2023-12-21 11:24:14,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:14,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-12-21 11:24:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,580 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-21 11:24:14,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:14,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726589634] [2023-12-21 11:24:14,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726589634] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:14,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:14,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:24:14,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071145381] [2023-12-21 11:24:14,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:14,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:24:14,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:14,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:24:14,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:14,581 INFO L87 Difference]: Start difference. First operand 286 states and 393 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-21 11:24:14,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:14,600 INFO L93 Difference]: Finished difference Result 432 states and 614 transitions. [2023-12-21 11:24:14,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:14,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 178 [2023-12-21 11:24:14,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:14,602 INFO L225 Difference]: With dead ends: 432 [2023-12-21 11:24:14,602 INFO L226 Difference]: Without dead ends: 286 [2023-12-21 11:24:14,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-21 11:24:14,603 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 0 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1029 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-21 11:24:14,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1029 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:14,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-12-21 11:24:14,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2023-12-21 11:24:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 228 states have (on average 1.293859649122807) internal successors, (295), 232 states have internal predecessors, (295), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 11:24:14,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 387 transitions. [2023-12-21 11:24:14,612 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 387 transitions. Word has length 178 [2023-12-21 11:24:14,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:14,612 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 387 transitions. [2023-12-21 11:24:14,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-21 11:24:14,613 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 387 transitions. [2023-12-21 11:24:14,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-21 11:24:14,614 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:14,614 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:14,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-21 11:24:14,615 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:14,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:14,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1759580199, now seen corresponding path program 1 times [2023-12-21 11:24:14,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:14,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001867822] [2023-12-21 11:24:14,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:14,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-12-21 11:24:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,716 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-21 11:24:14,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:14,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001867822] [2023-12-21 11:24:14,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001867822] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:14,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986107965] [2023-12-21 11:24:14,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:14,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:14,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:14,734 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-21 11:24:14,757 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-21 11:24:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 11:24:14,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:14,933 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-21 11:24:14,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:24:15,034 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-21 11:24:15,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986107965] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:15,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-21 11:24:15,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2023-12-21 11:24:15,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865557744] [2023-12-21 11:24:15,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:15,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:15,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:15,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:15,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:15,036 INFO L87 Difference]: Start difference. First operand 286 states and 387 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 11:24:15,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:15,065 INFO L93 Difference]: Finished difference Result 453 states and 636 transitions. [2023-12-21 11:24:15,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:24:15,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 185 [2023-12-21 11:24:15,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:15,078 INFO L225 Difference]: With dead ends: 453 [2023-12-21 11:24:15,078 INFO L226 Difference]: Without dead ends: 265 [2023-12-21 11:24:15,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 396 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-21 11:24:15,079 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 20 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 711 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-21 11:24:15,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 711 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:15,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-12-21 11:24:15,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2023-12-21 11:24:15,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 210 states have (on average 1.2857142857142858) internal successors, (270), 214 states have internal predecessors, (270), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2023-12-21 11:24:15,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 356 transitions. [2023-12-21 11:24:15,087 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 356 transitions. Word has length 185 [2023-12-21 11:24:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:15,087 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 356 transitions. [2023-12-21 11:24:15,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 11:24:15,088 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 356 transitions. [2023-12-21 11:24:15,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-12-21 11:24:15,089 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:15,089 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:15,103 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-21 11:24:15,303 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-21 11:24:15,303 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:15,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:15,303 INFO L85 PathProgramCache]: Analyzing trace with hash 238343948, now seen corresponding path program 1 times [2023-12-21 11:24:15,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:15,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378415791] [2023-12-21 11:24:15,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:15,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:24:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,405 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-21 11:24:15,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:15,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378415791] [2023-12-21 11:24:15,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378415791] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:15,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:15,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:15,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104702104] [2023-12-21 11:24:15,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:15,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:15,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:15,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:15,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:15,407 INFO L87 Difference]: Start difference. First operand 265 states and 356 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-21 11:24:15,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:15,431 INFO L93 Difference]: Finished difference Result 410 states and 577 transitions. [2023-12-21 11:24:15,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:15,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 209 [2023-12-21 11:24:15,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:15,433 INFO L225 Difference]: With dead ends: 410 [2023-12-21 11:24:15,433 INFO L226 Difference]: Without dead ends: 271 [2023-12-21 11:24:15,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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-21 11:24:15,434 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 6 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 752 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-21 11:24:15,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 752 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:15,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-12-21 11:24:15,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2023-12-21 11:24:15,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 213 states have (on average 1.2816901408450705) internal successors, (273), 217 states have internal predecessors, (273), 43 states have call successors, (43), 12 states have call predecessors, (43), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2023-12-21 11:24:15,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 359 transitions. [2023-12-21 11:24:15,446 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 359 transitions. Word has length 209 [2023-12-21 11:24:15,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:15,446 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 359 transitions. [2023-12-21 11:24:15,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-21 11:24:15,447 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 359 transitions. [2023-12-21 11:24:15,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-21 11:24:15,448 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:15,448 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:15,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-21 11:24:15,448 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:15,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:15,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2053627783, now seen corresponding path program 1 times [2023-12-21 11:24:15,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:15,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238611302] [2023-12-21 11:24:15,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:15,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:24:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:24:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,604 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-21 11:24:15,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:15,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238611302] [2023-12-21 11:24:15,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238611302] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:15,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145779766] [2023-12-21 11:24:15,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:15,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:15,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:15,605 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-21 11:24:15,625 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-21 11:24:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 11:24:15,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:15,775 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-21 11:24:15,776 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:24:15,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145779766] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:15,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:24:15,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-12-21 11:24:15,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196749937] [2023-12-21 11:24:15,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:15,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:15,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:15,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:15,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:15,778 INFO L87 Difference]: Start difference. First operand 269 states and 359 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-21 11:24:15,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:15,805 INFO L93 Difference]: Finished difference Result 419 states and 584 transitions. [2023-12-21 11:24:15,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:15,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 216 [2023-12-21 11:24:15,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:15,807 INFO L225 Difference]: With dead ends: 419 [2023-12-21 11:24:15,807 INFO L226 Difference]: Without dead ends: 276 [2023-12-21 11:24:15,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 253 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-21 11:24:15,808 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 7 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 757 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-21 11:24:15,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 757 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:15,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2023-12-21 11:24:15,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 274. [2023-12-21 11:24:15,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 217 states have (on average 1.2764976958525345) internal successors, (277), 221 states have internal predecessors, (277), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2023-12-21 11:24:15,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 363 transitions. [2023-12-21 11:24:15,816 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 363 transitions. Word has length 216 [2023-12-21 11:24:15,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:15,818 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 363 transitions. [2023-12-21 11:24:15,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-21 11:24:15,818 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 363 transitions. [2023-12-21 11:24:15,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-12-21 11:24:15,820 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:15,820 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:15,838 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-21 11:24:16,026 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-21 11:24:16,026 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:16,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:16,027 INFO L85 PathProgramCache]: Analyzing trace with hash 930837717, now seen corresponding path program 1 times [2023-12-21 11:24:16,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:16,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065763691] [2023-12-21 11:24:16,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:16,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:24:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:24:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:24:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,137 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-21 11:24:16,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:16,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065763691] [2023-12-21 11:24:16,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065763691] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:16,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260994359] [2023-12-21 11:24:16,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:16,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:16,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:16,138 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-21 11:24:16,152 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-21 11:24:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 11:24:16,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:16,307 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-21 11:24:16,308 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:24:16,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260994359] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:16,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:24:16,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-12-21 11:24:16,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144743707] [2023-12-21 11:24:16,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:16,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:16,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:16,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:16,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:16,311 INFO L87 Difference]: Start difference. First operand 274 states and 363 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-21 11:24:16,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:16,339 INFO L93 Difference]: Finished difference Result 421 states and 582 transitions. [2023-12-21 11:24:16,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:24:16,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 224 [2023-12-21 11:24:16,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:16,341 INFO L225 Difference]: With dead ends: 421 [2023-12-21 11:24:16,341 INFO L226 Difference]: Without dead ends: 273 [2023-12-21 11:24:16,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:24:16,343 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 7 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 743 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-21 11:24:16,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 743 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:16,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-12-21 11:24:16,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2023-12-21 11:24:16,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 217 states have (on average 1.262672811059908) internal successors, (274), 220 states have internal predecessors, (274), 42 states have call successors, (42), 13 states have call predecessors, (42), 13 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 11:24:16,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 358 transitions. [2023-12-21 11:24:16,354 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 358 transitions. Word has length 224 [2023-12-21 11:24:16,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:16,354 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 358 transitions. [2023-12-21 11:24:16,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-21 11:24:16,354 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 358 transitions. [2023-12-21 11:24:16,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-12-21 11:24:16,356 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:16,356 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:16,379 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-21 11:24:16,562 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-21 11:24:16,563 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:16,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:16,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1128030971, now seen corresponding path program 1 times [2023-12-21 11:24:16,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:16,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645146215] [2023-12-21 11:24:16,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:16,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:24:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:24:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:24:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-21 11:24:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,699 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-21 11:24:16,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:16,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645146215] [2023-12-21 11:24:16,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645146215] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:16,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:16,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:16,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980255385] [2023-12-21 11:24:16,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:16,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:16,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:16,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:16,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:16,700 INFO L87 Difference]: Start difference. First operand 273 states and 358 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 11:24:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:16,891 INFO L93 Difference]: Finished difference Result 419 states and 571 transitions. [2023-12-21 11:24:16,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:24:16,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 231 [2023-12-21 11:24:16,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:16,893 INFO L225 Difference]: With dead ends: 419 [2023-12-21 11:24:16,893 INFO L226 Difference]: Without dead ends: 272 [2023-12-21 11:24:16,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:16,894 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 63 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:16,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 464 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:24:16,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2023-12-21 11:24:16,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2023-12-21 11:24:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 217 states have (on average 1.2580645161290323) internal successors, (273), 219 states have internal predecessors, (273), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-21 11:24:16,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 355 transitions. [2023-12-21 11:24:16,908 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 355 transitions. Word has length 231 [2023-12-21 11:24:16,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:16,908 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 355 transitions. [2023-12-21 11:24:16,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 11:24:16,908 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 355 transitions. [2023-12-21 11:24:16,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2023-12-21 11:24:16,910 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:16,910 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:16,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-21 11:24:16,910 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:16,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:16,911 INFO L85 PathProgramCache]: Analyzing trace with hash -162714812, now seen corresponding path program 1 times [2023-12-21 11:24:16,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:16,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986820705] [2023-12-21 11:24:16,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:16,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:24:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:24:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:24:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-21 11:24:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,069 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-21 11:24:17,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:17,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986820705] [2023-12-21 11:24:17,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986820705] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:17,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:17,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:24:17,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127287456] [2023-12-21 11:24:17,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:17,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:24:17,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:17,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:24:17,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:17,070 INFO L87 Difference]: Start difference. First operand 272 states and 355 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 11:24:17,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:17,458 INFO L93 Difference]: Finished difference Result 630 states and 851 transitions. [2023-12-21 11:24:17,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 11:24:17,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 234 [2023-12-21 11:24:17,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:17,461 INFO L225 Difference]: With dead ends: 630 [2023-12-21 11:24:17,461 INFO L226 Difference]: Without dead ends: 484 [2023-12-21 11:24:17,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 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-21 11:24:17,463 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 417 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:17,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 613 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 11:24:17,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2023-12-21 11:24:17,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 478. [2023-12-21 11:24:17,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 376 states have (on average 1.3111702127659575) internal successors, (493), 378 states have internal predecessors, (493), 70 states have call successors, (70), 31 states have call predecessors, (70), 31 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2023-12-21 11:24:17,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 633 transitions. [2023-12-21 11:24:17,491 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 633 transitions. Word has length 234 [2023-12-21 11:24:17,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:17,492 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 633 transitions. [2023-12-21 11:24:17,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 11:24:17,492 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 633 transitions. [2023-12-21 11:24:17,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2023-12-21 11:24:17,494 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:17,494 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:17,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-21 11:24:17,494 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:17,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:17,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2125325853, now seen corresponding path program 1 times [2023-12-21 11:24:17,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:17,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897213866] [2023-12-21 11:24:17,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:17,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:24:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:24:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:24:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-21 11:24:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-21 11:24:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-12-21 11:24:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-12-21 11:24:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-12-21 11:24:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2023-12-21 11:24:17,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:17,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897213866] [2023-12-21 11:24:17,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897213866] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:17,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:17,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:17,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315202747] [2023-12-21 11:24:17,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:17,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:17,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:17,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:17,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:17,634 INFO L87 Difference]: Start difference. First operand 478 states and 633 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, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-21 11:24:17,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:17,929 INFO L93 Difference]: Finished difference Result 1045 states and 1435 transitions. [2023-12-21 11:24:17,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:17,930 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, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 264 [2023-12-21 11:24:17,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:17,933 INFO L225 Difference]: With dead ends: 1045 [2023-12-21 11:24:17,933 INFO L226 Difference]: Without dead ends: 765 [2023-12-21 11:24:17,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-21 11:24:17,934 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 224 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:17,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 461 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:24:17,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2023-12-21 11:24:17,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 596. [2023-12-21 11:24:17,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 469 states have (on average 1.3198294243070363) internal successors, (619), 475 states have internal predecessors, (619), 85 states have call successors, (85), 41 states have call predecessors, (85), 41 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2023-12-21 11:24:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 789 transitions. [2023-12-21 11:24:17,969 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 789 transitions. Word has length 264 [2023-12-21 11:24:17,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:17,969 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 789 transitions. [2023-12-21 11:24:17,969 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, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-21 11:24:17,969 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 789 transitions. [2023-12-21 11:24:17,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2023-12-21 11:24:17,972 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:17,972 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:17,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-21 11:24:17,972 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:17,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:17,972 INFO L85 PathProgramCache]: Analyzing trace with hash 965816563, now seen corresponding path program 1 times [2023-12-21 11:24:17,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:17,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135436398] [2023-12-21 11:24:17,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:17,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:18,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:24:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:24:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:24:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-21 11:24:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-12-21 11:24:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2023-12-21 11:24:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-12-21 11:24:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-12-21 11:24:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,111 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2023-12-21 11:24:18,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:18,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135436398] [2023-12-21 11:24:18,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135436398] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:18,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:18,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:18,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897783924] [2023-12-21 11:24:18,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:18,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:18,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:18,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:18,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:18,112 INFO L87 Difference]: Start difference. First operand 596 states and 789 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-21 11:24:18,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:18,413 INFO L93 Difference]: Finished difference Result 1316 states and 1793 transitions. [2023-12-21 11:24:18,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:18,414 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), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 265 [2023-12-21 11:24:18,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:18,417 INFO L225 Difference]: With dead ends: 1316 [2023-12-21 11:24:18,417 INFO L226 Difference]: Without dead ends: 951 [2023-12-21 11:24:18,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-21 11:24:18,419 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 225 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:18,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 489 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:24:18,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2023-12-21 11:24:18,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 943. [2023-12-21 11:24:18,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 736 states have (on average 1.3478260869565217) internal successors, (992), 750 states have internal predecessors, (992), 139 states have call successors, (139), 67 states have call predecessors, (139), 67 states have return successors, (139), 129 states have call predecessors, (139), 139 states have call successors, (139) [2023-12-21 11:24:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1270 transitions. [2023-12-21 11:24:18,472 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1270 transitions. Word has length 265 [2023-12-21 11:24:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:18,474 INFO L495 AbstractCegarLoop]: Abstraction has 943 states and 1270 transitions. [2023-12-21 11:24:18,474 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), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-21 11:24:18,474 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1270 transitions. [2023-12-21 11:24:18,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2023-12-21 11:24:18,476 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:18,476 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:18,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-21 11:24:18,477 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:18,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:18,477 INFO L85 PathProgramCache]: Analyzing trace with hash 542333624, now seen corresponding path program 1 times [2023-12-21 11:24:18,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:18,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199341650] [2023-12-21 11:24:18,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:18,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:24:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:24:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:24:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-21 11:24:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-21 11:24:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-21 11:24:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2023-12-21 11:24:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-21 11:24:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,598 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2023-12-21 11:24:18,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:18,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199341650] [2023-12-21 11:24:18,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199341650] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:18,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:18,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:18,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143212363] [2023-12-21 11:24:18,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:18,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:18,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:18,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:18,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:18,601 INFO L87 Difference]: Start difference. First operand 943 states and 1270 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-21 11:24:18,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:18,956 INFO L93 Difference]: Finished difference Result 2195 states and 3032 transitions. [2023-12-21 11:24:18,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:18,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 266 [2023-12-21 11:24:18,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:18,965 INFO L225 Difference]: With dead ends: 2195 [2023-12-21 11:24:18,965 INFO L226 Difference]: Without dead ends: 1523 [2023-12-21 11:24:18,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-21 11:24:18,967 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 225 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:18,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 516 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:24:18,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2023-12-21 11:24:19,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1509. [2023-12-21 11:24:19,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1170 states have (on average 1.3743589743589744) internal successors, (1608), 1198 states have internal predecessors, (1608), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2023-12-21 11:24:19,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2070 transitions. [2023-12-21 11:24:19,067 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2070 transitions. Word has length 266 [2023-12-21 11:24:19,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:19,067 INFO L495 AbstractCegarLoop]: Abstraction has 1509 states and 2070 transitions. [2023-12-21 11:24:19,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-21 11:24:19,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2070 transitions. [2023-12-21 11:24:19,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2023-12-21 11:24:19,070 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:19,070 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:19,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-21 11:24:19,070 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:19,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:19,070 INFO L85 PathProgramCache]: Analyzing trace with hash 147966838, now seen corresponding path program 1 times [2023-12-21 11:24:19,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:19,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737998171] [2023-12-21 11:24:19,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:19,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:24:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:24:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:24:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-21 11:24:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-21 11:24:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-21 11:24:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2023-12-21 11:24:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-21 11:24:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2023-12-21 11:24:19,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:19,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737998171] [2023-12-21 11:24:19,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737998171] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:19,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301210840] [2023-12-21 11:24:19,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:19,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:19,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:19,239 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-21 11:24:19,274 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-21 11:24:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 11:24:19,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:19,460 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2023-12-21 11:24:19,460 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:24:19,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301210840] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:19,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:24:19,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-12-21 11:24:19,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692246196] [2023-12-21 11:24:19,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:19,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:19,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:19,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:19,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-21 11:24:19,462 INFO L87 Difference]: Start difference. First operand 1509 states and 2070 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-21 11:24:19,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:19,581 INFO L93 Difference]: Finished difference Result 2787 states and 3881 transitions. [2023-12-21 11:24:19,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:19,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 266 [2023-12-21 11:24:19,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:19,586 INFO L225 Difference]: With dead ends: 2787 [2023-12-21 11:24:19,586 INFO L226 Difference]: Without dead ends: 1509 [2023-12-21 11:24:19,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 313 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-21 11:24:19,589 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 51 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 660 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-21 11:24:19,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 660 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:19,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2023-12-21 11:24:19,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1509. [2023-12-21 11:24:19,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1170 states have (on average 1.353846153846154) internal successors, (1584), 1198 states have internal predecessors, (1584), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2023-12-21 11:24:19,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2046 transitions. [2023-12-21 11:24:19,671 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2046 transitions. Word has length 266 [2023-12-21 11:24:19,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:19,672 INFO L495 AbstractCegarLoop]: Abstraction has 1509 states and 2046 transitions. [2023-12-21 11:24:19,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-21 11:24:19,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2046 transitions. [2023-12-21 11:24:19,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2023-12-21 11:24:19,674 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:19,674 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:19,693 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-21 11:24:19,881 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-21 11:24:19,881 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:19,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:19,881 INFO L85 PathProgramCache]: Analyzing trace with hash -338351429, now seen corresponding path program 1 times [2023-12-21 11:24:19,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:19,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238573653] [2023-12-21 11:24:19,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:19,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:20,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:20,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:20,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:20,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:20,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:20,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:20,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:20,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:20,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:20,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:20,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:20,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:24:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:20,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:24:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:20,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:24:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:20,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-21 11:24:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:20,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-21 11:24:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:20,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-21 11:24:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:20,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-12-21 11:24:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:20,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2023-12-21 11:24:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:20,064 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2023-12-21 11:24:20,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:20,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238573653] [2023-12-21 11:24:20,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238573653] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:20,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93120883] [2023-12-21 11:24:20,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:20,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:20,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:20,079 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-21 11:24:20,154 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-21 11:24:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:20,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 11:24:20,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2023-12-21 11:24:20,326 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:24:20,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93120883] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:20,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:24:20,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-12-21 11:24:20,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41820648] [2023-12-21 11:24:20,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:20,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:20,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:20,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:20,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-21 11:24:20,328 INFO L87 Difference]: Start difference. First operand 1509 states and 2046 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (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-21 11:24:20,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:20,453 INFO L93 Difference]: Finished difference Result 2787 states and 3825 transitions. [2023-12-21 11:24:20,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:20,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (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 267 [2023-12-21 11:24:20,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:20,459 INFO L225 Difference]: With dead ends: 2787 [2023-12-21 11:24:20,459 INFO L226 Difference]: Without dead ends: 1557 [2023-12-21 11:24:20,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 314 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-21 11:24:20,462 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 15 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 683 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-21 11:24:20,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 683 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2023-12-21 11:24:20,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1557. [2023-12-21 11:24:20,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1210 states have (on average 1.3553719008264462) internal successors, (1640), 1238 states have internal predecessors, (1640), 231 states have call successors, (231), 115 states have call predecessors, (231), 115 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2023-12-21 11:24:20,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2102 transitions. [2023-12-21 11:24:20,543 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2102 transitions. Word has length 267 [2023-12-21 11:24:20,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:20,543 INFO L495 AbstractCegarLoop]: Abstraction has 1557 states and 2102 transitions. [2023-12-21 11:24:20,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (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-21 11:24:20,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2102 transitions. [2023-12-21 11:24:20,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2023-12-21 11:24:20,546 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:20,546 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, 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-21 11:24:20,554 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-21 11:24:20,752 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-21 11:24:20,753 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:20,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:20,754 INFO L85 PathProgramCache]: Analyzing trace with hash -8905584, now seen corresponding path program 1 times [2023-12-21 11:24:20,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:20,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673384550] [2023-12-21 11:24:20,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:20,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:20,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:20,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:24:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:24:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:24:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-21 11:24:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-21 11:24:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-21 11:24:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-12-21 11:24:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-12-21 11:24:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,062 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2023-12-21 11:24:21,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:21,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673384550] [2023-12-21 11:24:21,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673384550] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:21,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:21,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 11:24:21,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710226144] [2023-12-21 11:24:21,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:21,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 11:24:21,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:21,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 11:24:21,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:24:21,063 INFO L87 Difference]: Start difference. First operand 1557 states and 2102 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, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-21 11:24:21,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:21,623 INFO L93 Difference]: Finished difference Result 2371 states and 3433 transitions. [2023-12-21 11:24:21,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 11:24:21,623 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, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 268 [2023-12-21 11:24:21,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:21,637 INFO L225 Difference]: With dead ends: 2371 [2023-12-21 11:24:21,637 INFO L226 Difference]: Without dead ends: 2369 [2023-12-21 11:24:21,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 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-21 11:24:21,638 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 232 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:21,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 1462 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 11:24:21,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2023-12-21 11:24:21,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1605. [2023-12-21 11:24:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1242 states have (on average 1.3462157809983897) internal successors, (1672), 1278 states have internal predecessors, (1672), 239 states have call successors, (239), 123 states have call predecessors, (239), 123 states have return successors, (239), 211 states have call predecessors, (239), 239 states have call successors, (239) [2023-12-21 11:24:21,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2150 transitions. [2023-12-21 11:24:21,745 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2150 transitions. Word has length 268 [2023-12-21 11:24:21,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:21,745 INFO L495 AbstractCegarLoop]: Abstraction has 1605 states and 2150 transitions. [2023-12-21 11:24:21,745 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, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-21 11:24:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2150 transitions. [2023-12-21 11:24:21,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2023-12-21 11:24:21,748 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:21,748 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, 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] [2023-12-21 11:24:21,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-21 11:24:21,749 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:21,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:21,749 INFO L85 PathProgramCache]: Analyzing trace with hash -767029101, now seen corresponding path program 1 times [2023-12-21 11:24:21,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:21,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432035585] [2023-12-21 11:24:21,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:21,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:24:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:24:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:24:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-21 11:24:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-21 11:24:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-21 11:24:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-12-21 11:24:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-12-21 11:24:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2023-12-21 11:24:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,040 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2023-12-21 11:24:22,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:22,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432035585] [2023-12-21 11:24:22,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432035585] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:22,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56024068] [2023-12-21 11:24:22,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:22,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:22,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:22,062 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-21 11:24:22,085 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-21 11:24:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 11:24:22,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:22,395 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 251 proven. 37 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2023-12-21 11:24:22,395 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:24:22,656 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2023-12-21 11:24:22,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56024068] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:24:22,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:24:22,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2023-12-21 11:24:22,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926686438] [2023-12-21 11:24:22,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:24:22,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-21 11:24:22,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:22,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-21 11:24:22,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2023-12-21 11:24:22,659 INFO L87 Difference]: Start difference. First operand 1605 states and 2150 transitions. Second operand has 19 states, 19 states have (on average 7.842105263157895) internal successors, (149), 14 states have internal predecessors, (149), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2023-12-21 11:24:24,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:24,055 INFO L93 Difference]: Finished difference Result 4131 states and 5853 transitions. [2023-12-21 11:24:24,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 11:24:24,056 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.842105263157895) internal successors, (149), 14 states have internal predecessors, (149), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) Word has length 276 [2023-12-21 11:24:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:24,067 INFO L225 Difference]: With dead ends: 4131 [2023-12-21 11:24:24,067 INFO L226 Difference]: Without dead ends: 2805 [2023-12-21 11:24:24,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 598 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-21 11:24:24,071 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 390 mSDsluCounter, 2033 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 2264 SdHoareTripleChecker+Invalid, 1884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:24,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 2264 Invalid, 1884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-21 11:24:24,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states. [2023-12-21 11:24:24,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 2383. [2023-12-21 11:24:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2383 states, 1837 states have (on average 1.3331518780620577) internal successors, (2449), 1889 states have internal predecessors, (2449), 356 states have call successors, (356), 183 states have call predecessors, (356), 189 states have return successors, (364), 318 states have call predecessors, (364), 356 states have call successors, (364) [2023-12-21 11:24:24,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 3169 transitions. [2023-12-21 11:24:24,221 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 3169 transitions. Word has length 276 [2023-12-21 11:24:24,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:24,221 INFO L495 AbstractCegarLoop]: Abstraction has 2383 states and 3169 transitions. [2023-12-21 11:24:24,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.842105263157895) internal successors, (149), 14 states have internal predecessors, (149), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2023-12-21 11:24:24,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 3169 transitions. [2023-12-21 11:24:24,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2023-12-21 11:24:24,224 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:24,224 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, 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] [2023-12-21 11:24:24,233 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-21 11:24:24,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:24,434 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:24,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:24,434 INFO L85 PathProgramCache]: Analyzing trace with hash 194584916, now seen corresponding path program 1 times [2023-12-21 11:24:24,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:24,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027044231] [2023-12-21 11:24:24,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:24,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:24:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:24:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:24:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-21 11:24:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-21 11:24:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-21 11:24:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-12-21 11:24:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-12-21 11:24:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2023-12-21 11:24:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,575 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2023-12-21 11:24:24,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:24,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027044231] [2023-12-21 11:24:24,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027044231] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:24,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473701859] [2023-12-21 11:24:24,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:24,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:24,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:24,593 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-21 11:24:24,623 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-21 11:24:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 11:24:24,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2023-12-21 11:24:24,778 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:24:24,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473701859] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:24,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:24:24,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-12-21 11:24:24,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497515713] [2023-12-21 11:24:24,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:24,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:24,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:24,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:24,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:24,781 INFO L87 Difference]: Start difference. First operand 2383 states and 3169 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, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 11:24:24,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:24,954 INFO L93 Difference]: Finished difference Result 4600 states and 6215 transitions. [2023-12-21 11:24:24,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:24,955 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, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 276 [2023-12-21 11:24:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:24,964 INFO L225 Difference]: With dead ends: 4600 [2023-12-21 11:24:24,964 INFO L226 Difference]: Without dead ends: 2319 [2023-12-21 11:24:24,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 326 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-21 11:24:24,986 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 11 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 683 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-21 11:24:24,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 683 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:24,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2023-12-21 11:24:25,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2319. [2023-12-21 11:24:25,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2319 states, 1793 states have (on average 1.3156720580033463) internal successors, (2359), 1845 states have internal predecessors, (2359), 340 states have call successors, (340), 183 states have call predecessors, (340), 185 states have return successors, (344), 298 states have call predecessors, (344), 340 states have call successors, (344) [2023-12-21 11:24:25,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 3043 transitions. [2023-12-21 11:24:25,111 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 3043 transitions. Word has length 276 [2023-12-21 11:24:25,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:25,111 INFO L495 AbstractCegarLoop]: Abstraction has 2319 states and 3043 transitions. [2023-12-21 11:24:25,111 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, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 11:24:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 3043 transitions. [2023-12-21 11:24:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2023-12-21 11:24:25,114 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:25,114 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, 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] [2023-12-21 11:24:25,123 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-21 11:24:25,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:25,321 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:25,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:25,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2011160599, now seen corresponding path program 1 times [2023-12-21 11:24:25,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:25,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188200349] [2023-12-21 11:24:25,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:25,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-21 11:24:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-21 11:24:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:24:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-21 11:24:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-12-21 11:24:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2023-12-21 11:24:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-12-21 11:24:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-12-21 11:24:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2023-12-21 11:24:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2023-12-21 11:24:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-21 11:24:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,434 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2023-12-21 11:24:25,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:25,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188200349] [2023-12-21 11:24:25,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188200349] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:25,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099082410] [2023-12-21 11:24:25,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:25,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:25,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:25,436 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-21 11:24:25,462 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-21 11:24:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 11:24:25,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2023-12-21 11:24:25,601 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:24:25,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099082410] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:25,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:24:25,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-12-21 11:24:25,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667830167] [2023-12-21 11:24:25,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:25,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:25,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:25,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:25,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:25,602 INFO L87 Difference]: Start difference. First operand 2319 states and 3043 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, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-21 11:24:25,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:25,751 INFO L93 Difference]: Finished difference Result 4382 states and 5856 transitions. [2023-12-21 11:24:25,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:25,752 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, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 279 [2023-12-21 11:24:25,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:25,758 INFO L225 Difference]: With dead ends: 4382 [2023-12-21 11:24:25,758 INFO L226 Difference]: Without dead ends: 2147 [2023-12-21 11:24:25,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 329 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-21 11:24:25,762 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 8 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 686 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-21 11:24:25,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 686 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:25,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2023-12-21 11:24:25,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2147. [2023-12-21 11:24:25,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2147 states, 1651 states have (on average 1.3095093882495457) internal successors, (2162), 1703 states have internal predecessors, (2162), 323 states have call successors, (323), 172 states have call predecessors, (323), 172 states have return successors, (323), 279 states have call predecessors, (323), 323 states have call successors, (323) [2023-12-21 11:24:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 2808 transitions. [2023-12-21 11:24:25,869 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 2808 transitions. Word has length 279 [2023-12-21 11:24:25,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:25,869 INFO L495 AbstractCegarLoop]: Abstraction has 2147 states and 2808 transitions. [2023-12-21 11:24:25,869 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, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-21 11:24:25,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 2808 transitions. [2023-12-21 11:24:25,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2023-12-21 11:24:25,871 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:25,872 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:25,880 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-21 11:24:26,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:26,078 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:26,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:26,079 INFO L85 PathProgramCache]: Analyzing trace with hash 435768030, now seen corresponding path program 1 times [2023-12-21 11:24:26,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:26,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122549508] [2023-12-21 11:24:26,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:26,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:24:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:24:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:24:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-21 11:24:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-21 11:24:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-21 11:24:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-12-21 11:24:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-12-21 11:24:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2023-12-21 11:24:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2023-12-21 11:24:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2023-12-21 11:24:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 16 proven. 146 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2023-12-21 11:24:26,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:26,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122549508] [2023-12-21 11:24:26,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122549508] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:26,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057007247] [2023-12-21 11:24:26,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:26,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:26,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:26,598 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-21 11:24:26,608 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-21 11:24:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-21 11:24:26,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:26,886 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2023-12-21 11:24:26,886 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:24:26,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057007247] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:26,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:24:26,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2023-12-21 11:24:26,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951789300] [2023-12-21 11:24:26,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:26,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 11:24:26,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:26,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 11:24:26,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2023-12-21 11:24:26,887 INFO L87 Difference]: Start difference. First operand 2147 states and 2808 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-21 11:24:27,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:27,181 INFO L93 Difference]: Finished difference Result 4793 states and 6263 transitions. [2023-12-21 11:24:27,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 11:24:27,182 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 291 [2023-12-21 11:24:27,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:27,192 INFO L225 Difference]: With dead ends: 4793 [2023-12-21 11:24:27,192 INFO L226 Difference]: Without dead ends: 3203 [2023-12-21 11:24:27,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 338 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-21 11:24:27,196 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 134 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1735 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:27,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1735 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:24:27,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3203 states. [2023-12-21 11:24:27,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3203 to 3149. [2023-12-21 11:24:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3149 states, 2414 states have (on average 1.3024026512013256) internal successors, (3144), 2494 states have internal predecessors, (3144), 467 states have call successors, (467), 267 states have call predecessors, (467), 267 states have return successors, (467), 395 states have call predecessors, (467), 467 states have call successors, (467) [2023-12-21 11:24:27,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4078 transitions. [2023-12-21 11:24:27,379 INFO L78 Accepts]: Start accepts. Automaton has 3149 states and 4078 transitions. Word has length 291 [2023-12-21 11:24:27,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:27,379 INFO L495 AbstractCegarLoop]: Abstraction has 3149 states and 4078 transitions. [2023-12-21 11:24:27,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-21 11:24:27,379 INFO L276 IsEmpty]: Start isEmpty. Operand 3149 states and 4078 transitions. [2023-12-21 11:24:27,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2023-12-21 11:24:27,381 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:27,381 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:27,402 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-21 11:24:27,587 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,SelfDestructingSolverStorable31 [2023-12-21 11:24:27,588 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:27,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:27,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1216360965, now seen corresponding path program 1 times [2023-12-21 11:24:27,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:27,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237909965] [2023-12-21 11:24:27,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:27,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:24:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:24:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:24:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-21 11:24:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-21 11:24:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-21 11:24:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-12-21 11:24:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-12-21 11:24:27,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2023-12-21 11:24:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2023-12-21 11:24:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-12-21 11:24:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,720 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2023-12-21 11:24:27,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:27,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237909965] [2023-12-21 11:24:27,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237909965] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:27,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:27,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 11:24:27,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046259813] [2023-12-21 11:24:27,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:27,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 11:24:27,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:27,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 11:24:27,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:24:27,723 INFO L87 Difference]: Start difference. First operand 3149 states and 4078 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, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-21 11:24:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:28,238 INFO L93 Difference]: Finished difference Result 7201 states and 9776 transitions. [2023-12-21 11:24:28,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 11:24:28,238 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, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 297 [2023-12-21 11:24:28,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:28,261 INFO L225 Difference]: With dead ends: 7201 [2023-12-21 11:24:28,261 INFO L226 Difference]: Without dead ends: 4549 [2023-12-21 11:24:28,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 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-21 11:24:28,266 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 185 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:28,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1219 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 11:24:28,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4549 states. [2023-12-21 11:24:28,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4549 to 3405. [2023-12-21 11:24:28,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3405 states, 2622 states have (on average 1.315026697177727) internal successors, (3448), 2702 states have internal predecessors, (3448), 515 states have call successors, (515), 267 states have call predecessors, (515), 267 states have return successors, (515), 443 states have call predecessors, (515), 515 states have call successors, (515) [2023-12-21 11:24:28,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 4478 transitions. [2023-12-21 11:24:28,524 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 4478 transitions. Word has length 297 [2023-12-21 11:24:28,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:28,524 INFO L495 AbstractCegarLoop]: Abstraction has 3405 states and 4478 transitions. [2023-12-21 11:24:28,524 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, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-21 11:24:28,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 4478 transitions. [2023-12-21 11:24:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2023-12-21 11:24:28,527 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:28,527 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:28,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-21 11:24:28,527 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:28,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:28,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1248191351, now seen corresponding path program 1 times [2023-12-21 11:24:28,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:28,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003294340] [2023-12-21 11:24:28,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:28,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:24:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:24:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:24:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-21 11:24:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-21 11:24:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-21 11:24:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-12-21 11:24:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-12-21 11:24:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2023-12-21 11:24:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2023-12-21 11:24:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-12-21 11:24:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,705 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2023-12-21 11:24:28,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:28,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003294340] [2023-12-21 11:24:28,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003294340] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:28,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:28,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 11:24:28,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324445853] [2023-12-21 11:24:28,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:28,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 11:24:28,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:28,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 11:24:28,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:24:28,707 INFO L87 Difference]: Start difference. First operand 3405 states and 4478 transitions. Second operand has 6 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-21 11:24:29,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:29,130 INFO L93 Difference]: Finished difference Result 6158 states and 8150 transitions. [2023-12-21 11:24:29,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 11:24:29,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 297 [2023-12-21 11:24:29,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:29,140 INFO L225 Difference]: With dead ends: 6158 [2023-12-21 11:24:29,140 INFO L226 Difference]: Without dead ends: 3355 [2023-12-21 11:24:29,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-21 11:24:29,146 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 63 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:29,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 764 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:24:29,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2023-12-21 11:24:29,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 3355. [2023-12-21 11:24:29,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3355 states, 2581 states have (on average 1.3115071677644323) internal successors, (3385), 2656 states have internal predecessors, (3385), 511 states have call successors, (511), 263 states have call predecessors, (511), 262 states have return successors, (510), 442 states have call predecessors, (510), 510 states have call successors, (510) [2023-12-21 11:24:29,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 4406 transitions. [2023-12-21 11:24:29,331 INFO L78 Accepts]: Start accepts. Automaton has 3355 states and 4406 transitions. Word has length 297 [2023-12-21 11:24:29,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:29,332 INFO L495 AbstractCegarLoop]: Abstraction has 3355 states and 4406 transitions. [2023-12-21 11:24:29,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-12-21 11:24:29,332 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 4406 transitions. [2023-12-21 11:24:29,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2023-12-21 11:24:29,334 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:29,334 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:29,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-21 11:24:29,335 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:29,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:29,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1894221007, now seen corresponding path program 1 times [2023-12-21 11:24:29,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:29,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375593803] [2023-12-21 11:24:29,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:29,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:24:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:24:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:24:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-21 11:24:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2023-12-21 11:24:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-21 11:24:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-21 11:24:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-12-21 11:24:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2023-12-21 11:24:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-12-21 11:24:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2023-12-21 11:24:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2023-12-21 11:24:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,658 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2023-12-21 11:24:29,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:29,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375593803] [2023-12-21 11:24:29,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375593803] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:29,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24023996] [2023-12-21 11:24:29,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:29,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:29,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:29,659 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-21 11:24:29,716 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-21 11:24:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:29,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-21 11:24:29,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 189 proven. 4 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2023-12-21 11:24:30,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:24:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2023-12-21 11:24:30,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24023996] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:30,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-21 11:24:30,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 10] total 21 [2023-12-21 11:24:30,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891045101] [2023-12-21 11:24:30,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:30,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 11:24:30,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:30,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 11:24:30,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2023-12-21 11:24:30,187 INFO L87 Difference]: Start difference. First operand 3355 states and 4406 transitions. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 9 states have internal predecessors, (96), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 11:24:31,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:31,262 INFO L93 Difference]: Finished difference Result 11635 states and 15543 transitions. [2023-12-21 11:24:31,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 11:24:31,263 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 9 states have internal predecessors, (96), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 302 [2023-12-21 11:24:31,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:31,287 INFO L225 Difference]: With dead ends: 11635 [2023-12-21 11:24:31,287 INFO L226 Difference]: Without dead ends: 8792 [2023-12-21 11:24:31,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 651 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=1187, Unknown=0, NotChecked=0, Total=1332 [2023-12-21 11:24:31,296 INFO L413 NwaCegarLoop]: 431 mSDtfsCounter, 751 mSDsluCounter, 2666 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 3097 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:31,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 3097 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 11:24:31,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8792 states. [2023-12-21 11:24:31,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8792 to 5440. [2023-12-21 11:24:31,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5440 states, 4164 states have (on average 1.3064361191162344) internal successors, (5440), 4284 states have internal predecessors, (5440), 852 states have call successors, (852), 424 states have call predecessors, (852), 423 states have return successors, (851), 738 states have call predecessors, (851), 851 states have call successors, (851) [2023-12-21 11:24:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5440 states to 5440 states and 7143 transitions. [2023-12-21 11:24:31,632 INFO L78 Accepts]: Start accepts. Automaton has 5440 states and 7143 transitions. Word has length 302 [2023-12-21 11:24:31,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:31,632 INFO L495 AbstractCegarLoop]: Abstraction has 5440 states and 7143 transitions. [2023-12-21 11:24:31,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 9 states have internal predecessors, (96), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 11:24:31,632 INFO L276 IsEmpty]: Start isEmpty. Operand 5440 states and 7143 transitions. [2023-12-21 11:24:31,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2023-12-21 11:24:31,635 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:31,635 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:31,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-21 11:24:31,856 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-21 11:24:31,857 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:31,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:31,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1218887887, now seen corresponding path program 1 times [2023-12-21 11:24:31,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:31,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738427476] [2023-12-21 11:24:31,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:31,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:24:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:24:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:24:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-21 11:24:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2023-12-21 11:24:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-21 11:24:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-21 11:24:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-12-21 11:24:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2023-12-21 11:24:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-12-21 11:24:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2023-12-21 11:24:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2023-12-21 11:24:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2023-12-21 11:24:32,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:32,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738427476] [2023-12-21 11:24:32,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738427476] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:32,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238093065] [2023-12-21 11:24:32,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:32,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:32,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:32,149 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-21 11:24:32,193 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-21 11:24:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:32,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-21 11:24:32,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:32,479 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2023-12-21 11:24:32,479 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:24:32,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238093065] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:32,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:24:32,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 15 [2023-12-21 11:24:32,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94970183] [2023-12-21 11:24:32,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:32,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 11:24:32,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:32,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 11:24:32,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-12-21 11:24:32,482 INFO L87 Difference]: Start difference. First operand 5440 states and 7143 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 11:24:33,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:33,057 INFO L93 Difference]: Finished difference Result 11434 states and 15253 transitions. [2023-12-21 11:24:33,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 11:24:33,058 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 302 [2023-12-21 11:24:33,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:33,078 INFO L225 Difference]: With dead ends: 11434 [2023-12-21 11:24:33,078 INFO L226 Difference]: Without dead ends: 6458 [2023-12-21 11:24:33,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2023-12-21 11:24:33,088 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 186 mSDsluCounter, 1715 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:33,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 2094 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:24:33,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6458 states. [2023-12-21 11:24:33,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6458 to 5276. [2023-12-21 11:24:33,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5276 states, 4040 states have (on average 1.299009900990099) internal successors, (5248), 4156 states have internal predecessors, (5248), 816 states have call successors, (816), 420 states have call predecessors, (816), 419 states have return successors, (815), 706 states have call predecessors, (815), 815 states have call successors, (815) [2023-12-21 11:24:33,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5276 states to 5276 states and 6879 transitions. [2023-12-21 11:24:33,427 INFO L78 Accepts]: Start accepts. Automaton has 5276 states and 6879 transitions. Word has length 302 [2023-12-21 11:24:33,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:33,428 INFO L495 AbstractCegarLoop]: Abstraction has 5276 states and 6879 transitions. [2023-12-21 11:24:33,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 11:24:33,428 INFO L276 IsEmpty]: Start isEmpty. Operand 5276 states and 6879 transitions. [2023-12-21 11:24:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2023-12-21 11:24:33,430 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:33,430 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:33,438 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-21 11:24:33,636 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-21 11:24:33,636 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:33,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:33,637 INFO L85 PathProgramCache]: Analyzing trace with hash 621231855, now seen corresponding path program 1 times [2023-12-21 11:24:33,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:33,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633446118] [2023-12-21 11:24:33,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:33,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:24:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:24:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:24:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-21 11:24:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2023-12-21 11:24:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-21 11:24:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-21 11:24:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-12-21 11:24:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2023-12-21 11:24:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2023-12-21 11:24:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2023-12-21 11:24:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-12-21 11:24:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2023-12-21 11:24:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2023-12-21 11:24:33,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:33,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633446118] [2023-12-21 11:24:33,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633446118] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:33,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:33,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:24:33,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861541004] [2023-12-21 11:24:33,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:33,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:24:33,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:33,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:24:33,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:33,739 INFO L87 Difference]: Start difference. First operand 5276 states and 6879 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 11:24:34,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:34,382 INFO L93 Difference]: Finished difference Result 8879 states and 11621 transitions. [2023-12-21 11:24:34,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 11:24:34,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 309 [2023-12-21 11:24:34,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:34,393 INFO L225 Difference]: With dead ends: 8879 [2023-12-21 11:24:34,393 INFO L226 Difference]: Without dead ends: 4363 [2023-12-21 11:24:34,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 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-21 11:24:34,400 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 472 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:34,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 746 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 11:24:34,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4363 states. [2023-12-21 11:24:34,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4363 to 4337. [2023-12-21 11:24:34,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4337 states, 3326 states have (on average 1.280216476247745) internal successors, (4258), 3420 states have internal predecessors, (4258), 665 states have call successors, (665), 345 states have call predecessors, (665), 345 states have return successors, (665), 571 states have call predecessors, (665), 665 states have call successors, (665) [2023-12-21 11:24:34,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4337 states to 4337 states and 5588 transitions. [2023-12-21 11:24:34,672 INFO L78 Accepts]: Start accepts. Automaton has 4337 states and 5588 transitions. Word has length 309 [2023-12-21 11:24:34,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:34,672 INFO L495 AbstractCegarLoop]: Abstraction has 4337 states and 5588 transitions. [2023-12-21 11:24:34,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 11:24:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 4337 states and 5588 transitions. [2023-12-21 11:24:34,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2023-12-21 11:24:34,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:34,678 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:34,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-21 11:24:34,678 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:34,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:34,678 INFO L85 PathProgramCache]: Analyzing trace with hash 778601870, now seen corresponding path program 1 times [2023-12-21 11:24:34,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:34,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394065779] [2023-12-21 11:24:34,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:34,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:24:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:24:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:24:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-21 11:24:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2023-12-21 11:24:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-21 11:24:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-21 11:24:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-12-21 11:24:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2023-12-21 11:24:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2023-12-21 11:24:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2023-12-21 11:24:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-12-21 11:24:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2023-12-21 11:24:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2023-12-21 11:24:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2023-12-21 11:24:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2023-12-21 11:24:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2023-12-21 11:24:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2023-12-21 11:24:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2023-12-21 11:24:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,307 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2023-12-21 11:24:35,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:35,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394065779] [2023-12-21 11:24:35,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394065779] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:35,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656712335] [2023-12-21 11:24:35,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:35,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:35,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:35,309 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-21 11:24:35,311 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-21 11:24:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:35,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-21 11:24:35,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:35,802 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 240 proven. 90 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2023-12-21 11:24:35,802 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:24:36,334 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 34 proven. 70 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2023-12-21 11:24:36,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656712335] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:24:36,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:24:36,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 34 [2023-12-21 11:24:36,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981224508] [2023-12-21 11:24:36,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:24:36,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 11:24:36,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:36,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 11:24:36,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 11:24:36,336 INFO L87 Difference]: Start difference. First operand 4337 states and 5588 transitions. Second operand has 34 states, 34 states have (on average 7.029411764705882) internal successors, (239), 29 states have internal predecessors, (239), 10 states have call successors, (67), 9 states have call predecessors, (67), 15 states have return successors, (67), 14 states have call predecessors, (67), 10 states have call successors, (67) [2023-12-21 11:25:01,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:25:01,006 INFO L93 Difference]: Finished difference Result 43506 states and 57298 transitions. [2023-12-21 11:25:01,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 405 states. [2023-12-21 11:25:01,006 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 7.029411764705882) internal successors, (239), 29 states have internal predecessors, (239), 10 states have call successors, (67), 9 states have call predecessors, (67), 15 states have return successors, (67), 14 states have call predecessors, (67), 10 states have call successors, (67) Word has length 356 [2023-12-21 11:25:01,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:25:01,115 INFO L225 Difference]: With dead ends: 43506 [2023-12-21 11:25:01,115 INFO L226 Difference]: Without dead ends: 39565 [2023-12-21 11:25:01,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1242 GetRequests, 800 SyntacticMatches, 8 SemanticMatches, 434 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80316 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=13143, Invalid=176517, Unknown=0, NotChecked=0, Total=189660 [2023-12-21 11:25:01,154 INFO L413 NwaCegarLoop]: 753 mSDtfsCounter, 6674 mSDsluCounter, 12351 mSDsCounter, 0 mSdLazyCounter, 14177 mSolverCounterSat, 2353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6674 SdHoareTripleChecker+Valid, 13104 SdHoareTripleChecker+Invalid, 16530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2353 IncrementalHoareTripleChecker+Valid, 14177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2023-12-21 11:25:01,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6674 Valid, 13104 Invalid, 16530 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2353 Valid, 14177 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2023-12-21 11:25:01,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39565 states. [2023-12-21 11:25:02,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39565 to 9551. [2023-12-21 11:25:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9551 states, 7296 states have (on average 1.255345394736842) internal successors, (9159), 7494 states have internal predecessors, (9159), 1473 states have call successors, (1473), 737 states have call predecessors, (1473), 781 states have return successors, (1535), 1319 states have call predecessors, (1535), 1473 states have call successors, (1535) [2023-12-21 11:25:02,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9551 states to 9551 states and 12167 transitions. [2023-12-21 11:25:02,449 INFO L78 Accepts]: Start accepts. Automaton has 9551 states and 12167 transitions. Word has length 356 [2023-12-21 11:25:02,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:25:02,449 INFO L495 AbstractCegarLoop]: Abstraction has 9551 states and 12167 transitions. [2023-12-21 11:25:02,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.029411764705882) internal successors, (239), 29 states have internal predecessors, (239), 10 states have call successors, (67), 9 states have call predecessors, (67), 15 states have return successors, (67), 14 states have call predecessors, (67), 10 states have call successors, (67) [2023-12-21 11:25:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 9551 states and 12167 transitions. [2023-12-21 11:25:02,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2023-12-21 11:25:02,464 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:25:02,464 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-21 11:25:02,486 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-21 11:25:02,671 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-21 11:25:02,672 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:25:02,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:25:02,672 INFO L85 PathProgramCache]: Analyzing trace with hash 117490334, now seen corresponding path program 1 times [2023-12-21 11:25:02,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:25:02,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810040014] [2023-12-21 11:25:02,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:25:02,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:25:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:25:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:25:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:25:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:25:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:25:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:25:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:25:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:25:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:25:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:25:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:25:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:25:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:25:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:25:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:25:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:25:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:25:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:25:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:25:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-21 11:25:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2023-12-21 11:25:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-12-21 11:25:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-12-21 11:25:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-12-21 11:25:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2023-12-21 11:25:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2023-12-21 11:25:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2023-12-21 11:25:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2023-12-21 11:25:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2023-12-21 11:25:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2023-12-21 11:25:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2023-12-21 11:25:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2023-12-21 11:25:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-12-21 11:25:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2023-12-21 11:25:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2023-12-21 11:25:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 16 proven. 22 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2023-12-21 11:25:03,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:25:03,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810040014] [2023-12-21 11:25:03,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810040014] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:25:03,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265014736] [2023-12-21 11:25:03,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:25:03,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:25:03,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:25:03,874 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-21 11:25:03,876 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-21 11:25:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:04,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-21 11:25:04,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:25:04,439 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 206 proven. 117 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2023-12-21 11:25:04,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:25:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 33 proven. 68 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2023-12-21 11:25:04,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265014736] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:25:04,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:25:04,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 35 [2023-12-21 11:25:04,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937518413] [2023-12-21 11:25:04,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:25:04,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-21 11:25:04,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:25:04,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-21 11:25:04,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1099, Unknown=0, NotChecked=0, Total=1190 [2023-12-21 11:25:04,887 INFO L87 Difference]: Start difference. First operand 9551 states and 12167 transitions. Second operand has 35 states, 35 states have (on average 6.857142857142857) internal successors, (240), 30 states have internal predecessors, (240), 11 states have call successors, (68), 9 states have call predecessors, (68), 14 states have return successors, (68), 15 states have call predecessors, (68), 11 states have call successors, (68) [2023-12-21 11:25:32,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:25:32,805 INFO L93 Difference]: Finished difference Result 42052 states and 53627 transitions. [2023-12-21 11:25:32,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 434 states. [2023-12-21 11:25:32,806 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 6.857142857142857) internal successors, (240), 30 states have internal predecessors, (240), 11 states have call successors, (68), 9 states have call predecessors, (68), 14 states have return successors, (68), 15 states have call predecessors, (68), 11 states have call successors, (68) Word has length 357 [2023-12-21 11:25:32,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:25:32,883 INFO L225 Difference]: With dead ends: 42052 [2023-12-21 11:25:32,883 INFO L226 Difference]: Without dead ends: 33308 [2023-12-21 11:25:32,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1278 GetRequests, 812 SyntacticMatches, 1 SemanticMatches, 465 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93718 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=14495, Invalid=203127, Unknown=0, NotChecked=0, Total=217622 [2023-12-21 11:25:32,914 INFO L413 NwaCegarLoop]: 749 mSDtfsCounter, 6897 mSDsluCounter, 12053 mSDsCounter, 0 mSdLazyCounter, 18800 mSolverCounterSat, 2580 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6897 SdHoareTripleChecker+Valid, 12802 SdHoareTripleChecker+Invalid, 21380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2580 IncrementalHoareTripleChecker+Valid, 18800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2023-12-21 11:25:32,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6897 Valid, 12802 Invalid, 21380 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2580 Valid, 18800 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2023-12-21 11:25:32,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33308 states. [2023-12-21 11:25:34,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33308 to 7172. [2023-12-21 11:25:34,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7172 states, 5556 states have (on average 1.2377609791216702) internal successors, (6877), 5691 states have internal predecessors, (6877), 1009 states have call successors, (1009), 567 states have call predecessors, (1009), 606 states have return successors, (1058), 913 states have call predecessors, (1058), 1009 states have call successors, (1058) [2023-12-21 11:25:34,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7172 states to 7172 states and 8944 transitions. [2023-12-21 11:25:34,453 INFO L78 Accepts]: Start accepts. Automaton has 7172 states and 8944 transitions. Word has length 357 [2023-12-21 11:25:34,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:25:34,453 INFO L495 AbstractCegarLoop]: Abstraction has 7172 states and 8944 transitions. [2023-12-21 11:25:34,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.857142857142857) internal successors, (240), 30 states have internal predecessors, (240), 11 states have call successors, (68), 9 states have call predecessors, (68), 14 states have return successors, (68), 15 states have call predecessors, (68), 11 states have call successors, (68) [2023-12-21 11:25:34,454 INFO L276 IsEmpty]: Start isEmpty. Operand 7172 states and 8944 transitions. [2023-12-21 11:25:34,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2023-12-21 11:25:34,463 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:25:34,463 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:25:34,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-21 11:25:34,669 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-21 11:25:34,670 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:25:34,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:25:34,670 INFO L85 PathProgramCache]: Analyzing trace with hash 991326124, now seen corresponding path program 1 times [2023-12-21 11:25:34,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:25:34,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494052456] [2023-12-21 11:25:34,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:25:34,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:25:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:25:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:25:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:25:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:25:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:25:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:25:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:25:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:25:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:25:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:25:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:25:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:25:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:25:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:25:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:25:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:25:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:25:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:25:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:25:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-21 11:25:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2023-12-21 11:25:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-21 11:25:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-12-21 11:25:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-21 11:25:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-12-21 11:25:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-12-21 11:25:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2023-12-21 11:25:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2023-12-21 11:25:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2023-12-21 11:25:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2023-12-21 11:25:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2023-12-21 11:25:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2023-12-21 11:25:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2023-12-21 11:25:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2023-12-21 11:25:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2023-12-21 11:25:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:34,794 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2023-12-21 11:25:34,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:25:34,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494052456] [2023-12-21 11:25:34,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494052456] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:25:34,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:25:34,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:25:34,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515503374] [2023-12-21 11:25:34,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:25:34,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:25:34,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:25:34,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:25:34,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:25:34,795 INFO L87 Difference]: Start difference. First operand 7172 states and 8944 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 11:25:36,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:25:36,137 INFO L93 Difference]: Finished difference Result 14546 states and 18106 transitions. [2023-12-21 11:25:36,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 11:25:36,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 358 [2023-12-21 11:25:36,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:25:36,153 INFO L225 Difference]: With dead ends: 14546 [2023-12-21 11:25:36,153 INFO L226 Difference]: Without dead ends: 7066 [2023-12-21 11:25:36,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 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-21 11:25:36,159 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 114 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:25:36,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 588 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:25:36,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7066 states. [2023-12-21 11:25:37,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7066 to 7066. [2023-12-21 11:25:37,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7066 states, 5489 states have (on average 1.2089633813080707) internal successors, (6636), 5599 states have internal predecessors, (6636), 1009 states have call successors, (1009), 567 states have call predecessors, (1009), 567 states have return successors, (1009), 899 states have call predecessors, (1009), 1009 states have call successors, (1009) [2023-12-21 11:25:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7066 states to 7066 states and 8654 transitions. [2023-12-21 11:25:37,318 INFO L78 Accepts]: Start accepts. Automaton has 7066 states and 8654 transitions. Word has length 358 [2023-12-21 11:25:37,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:25:37,318 INFO L495 AbstractCegarLoop]: Abstraction has 7066 states and 8654 transitions. [2023-12-21 11:25:37,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 11:25:37,318 INFO L276 IsEmpty]: Start isEmpty. Operand 7066 states and 8654 transitions. [2023-12-21 11:25:37,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2023-12-21 11:25:37,328 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:25:37,328 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:25:37,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-12-21 11:25:37,328 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:25:37,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:25:37,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1041302862, now seen corresponding path program 1 times [2023-12-21 11:25:37,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:25:37,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121988234] [2023-12-21 11:25:37,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:25:37,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:25:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:25:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:25:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:25:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:25:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:25:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:25:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:25:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:25:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:25:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:25:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:25:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:25:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:25:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:25:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:25:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:25:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:25:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:25:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:25:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-21 11:25:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2023-12-21 11:25:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-21 11:25:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-12-21 11:25:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-21 11:25:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-12-21 11:25:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-12-21 11:25:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2023-12-21 11:25:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2023-12-21 11:25:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2023-12-21 11:25:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2023-12-21 11:25:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2023-12-21 11:25:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2023-12-21 11:25:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2023-12-21 11:25:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2023-12-21 11:25:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2023-12-21 11:25:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2023-12-21 11:25:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:37,782 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 48 proven. 48 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2023-12-21 11:25:37,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:25:37,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121988234] [2023-12-21 11:25:37,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121988234] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:25:37,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874184986] [2023-12-21 11:25:37,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:25:37,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:25:37,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:25:37,784 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-21 11:25:37,800 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-21 11:25:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:38,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 1279 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-21 11:25:38,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:25:38,295 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 274 proven. 100 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2023-12-21 11:25:38,295 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:25:38,722 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 56 proven. 51 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2023-12-21 11:25:38,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874184986] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:25:38,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:25:38,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 23 [2023-12-21 11:25:38,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041501758] [2023-12-21 11:25:38,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:25:38,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-21 11:25:38,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:25:38,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-21 11:25:38,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2023-12-21 11:25:38,724 INFO L87 Difference]: Start difference. First operand 7066 states and 8654 transitions. Second operand has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 19 states have internal predecessors, (203), 5 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (49), 7 states have call predecessors, (49), 4 states have call successors, (49) [2023-12-21 11:25:46,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:25:46,237 INFO L93 Difference]: Finished difference Result 29691 states and 37026 transitions. [2023-12-21 11:25:46,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-21 11:25:46,238 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 19 states have internal predecessors, (203), 5 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (49), 7 states have call predecessors, (49), 4 states have call successors, (49) Word has length 368 [2023-12-21 11:25:46,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:25:46,290 INFO L225 Difference]: With dead ends: 29691 [2023-12-21 11:25:46,290 INFO L226 Difference]: Without dead ends: 23342 [2023-12-21 11:25:46,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 817 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=731, Invalid=3429, Unknown=0, NotChecked=0, Total=4160 [2023-12-21 11:25:46,305 INFO L413 NwaCegarLoop]: 676 mSDtfsCounter, 1580 mSDsluCounter, 6889 mSDsCounter, 0 mSdLazyCounter, 4298 mSolverCounterSat, 558 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1601 SdHoareTripleChecker+Valid, 7565 SdHoareTripleChecker+Invalid, 4856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 558 IncrementalHoareTripleChecker+Valid, 4298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:25:46,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1601 Valid, 7565 Invalid, 4856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [558 Valid, 4298 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-21 11:25:46,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23342 states. [2023-12-21 11:25:48,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23342 to 11726. [2023-12-21 11:25:48,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11726 states, 9004 states have (on average 1.206796979120391) internal successors, (10866), 9192 states have internal predecessors, (10866), 1768 states have call successors, (1768), 953 states have call predecessors, (1768), 953 states have return successors, (1768), 1580 states have call predecessors, (1768), 1768 states have call successors, (1768) [2023-12-21 11:25:48,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11726 states to 11726 states and 14402 transitions. [2023-12-21 11:25:48,718 INFO L78 Accepts]: Start accepts. Automaton has 11726 states and 14402 transitions. Word has length 368 [2023-12-21 11:25:48,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:25:48,719 INFO L495 AbstractCegarLoop]: Abstraction has 11726 states and 14402 transitions. [2023-12-21 11:25:48,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 19 states have internal predecessors, (203), 5 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (49), 7 states have call predecessors, (49), 4 states have call successors, (49) [2023-12-21 11:25:48,719 INFO L276 IsEmpty]: Start isEmpty. Operand 11726 states and 14402 transitions. [2023-12-21 11:25:48,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2023-12-21 11:25:48,738 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:25:48,738 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:25:48,745 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-21 11:25:48,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:25:48,945 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:25:48,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:25:48,945 INFO L85 PathProgramCache]: Analyzing trace with hash 46198595, now seen corresponding path program 1 times [2023-12-21 11:25:48,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:25:48,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816987111] [2023-12-21 11:25:48,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:25:48,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:25:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:25:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:25:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:25:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:25:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:25:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:25:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:25:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:25:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:25:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:25:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:25:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:25:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:25:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:25:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:25:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:25:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:25:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:25:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:25:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-12-21 11:25:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2023-12-21 11:25:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-21 11:25:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-12-21 11:25:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-21 11:25:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-12-21 11:25:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-12-21 11:25:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2023-12-21 11:25:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2023-12-21 11:25:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2023-12-21 11:25:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2023-12-21 11:25:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2023-12-21 11:25:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2023-12-21 11:25:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2023-12-21 11:25:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2023-12-21 11:25:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2023-12-21 11:25:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2023-12-21 11:25:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,823 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 16 proven. 22 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2023-12-21 11:25:49,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:25:49,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816987111] [2023-12-21 11:25:49,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816987111] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:25:49,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058717010] [2023-12-21 11:25:49,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:25:49,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:25:49,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:25:49,825 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-21 11:25:49,861 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-21 11:25:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:50,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 1279 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-21 11:25:50,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:25:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 342 proven. 126 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2023-12-21 11:25:50,470 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:25:51,010 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 41 proven. 204 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2023-12-21 11:25:51,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058717010] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:25:51,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:25:51,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 18] total 41 [2023-12-21 11:25:51,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628364132] [2023-12-21 11:25:51,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:25:51,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-21 11:25:51,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:25:51,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-21 11:25:51,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1533, Unknown=0, NotChecked=0, Total=1640 [2023-12-21 11:25:51,013 INFO L87 Difference]: Start difference. First operand 11726 states and 14402 transitions. Second operand has 41 states, 40 states have (on average 7.25) internal successors, (290), 35 states have internal predecessors, (290), 14 states have call successors, (79), 10 states have call predecessors, (79), 13 states have return successors, (80), 17 states have call predecessors, (80), 13 states have call successors, (80) [2023-12-21 11:26:19,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:26:19,258 INFO L93 Difference]: Finished difference Result 63562 states and 84804 transitions. [2023-12-21 11:26:19,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2023-12-21 11:26:19,259 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 7.25) internal successors, (290), 35 states have internal predecessors, (290), 14 states have call successors, (79), 10 states have call predecessors, (79), 13 states have return successors, (80), 17 states have call predecessors, (80), 13 states have call successors, (80) Word has length 368 [2023-12-21 11:26:19,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:26:19,408 INFO L225 Difference]: With dead ends: 63562 [2023-12-21 11:26:19,408 INFO L226 Difference]: Without dead ends: 52579 [2023-12-21 11:26:19,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1066 GetRequests, 802 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26657 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=5481, Invalid=65009, Unknown=0, NotChecked=0, Total=70490 [2023-12-21 11:26:19,436 INFO L413 NwaCegarLoop]: 628 mSDtfsCounter, 4225 mSDsluCounter, 14454 mSDsCounter, 0 mSdLazyCounter, 16712 mSolverCounterSat, 1489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4225 SdHoareTripleChecker+Valid, 15082 SdHoareTripleChecker+Invalid, 18201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1489 IncrementalHoareTripleChecker+Valid, 16712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-12-21 11:26:19,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4225 Valid, 15082 Invalid, 18201 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1489 Valid, 16712 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2023-12-21 11:26:19,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52579 states. [2023-12-21 11:26:22,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52579 to 14384. [2023-12-21 11:26:22,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14384 states, 11073 states have (on average 1.203377585116951) internal successors, (13325), 11286 states have internal predecessors, (13325), 2138 states have call successors, (2138), 1170 states have call predecessors, (2138), 1172 states have return successors, (2142), 1927 states have call predecessors, (2142), 2138 states have call successors, (2142) [2023-12-21 11:26:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14384 states to 14384 states and 17605 transitions. [2023-12-21 11:26:22,983 INFO L78 Accepts]: Start accepts. Automaton has 14384 states and 17605 transitions. Word has length 368 [2023-12-21 11:26:22,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:26:22,985 INFO L495 AbstractCegarLoop]: Abstraction has 14384 states and 17605 transitions. [2023-12-21 11:26:22,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 7.25) internal successors, (290), 35 states have internal predecessors, (290), 14 states have call successors, (79), 10 states have call predecessors, (79), 13 states have return successors, (80), 17 states have call predecessors, (80), 13 states have call successors, (80) [2023-12-21 11:26:22,986 INFO L276 IsEmpty]: Start isEmpty. Operand 14384 states and 17605 transitions. [2023-12-21 11:26:23,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2023-12-21 11:26:23,007 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:26:23,007 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-21 11:26:23,013 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-21 11:26:23,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:26:23,214 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:26:23,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:26:23,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1216291840, now seen corresponding path program 1 times [2023-12-21 11:26:23,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:26:23,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989165085] [2023-12-21 11:26:23,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:26:23,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:26:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:26:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:26:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 11:26:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-21 11:26:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:26:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:26:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:26:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:26:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 11:26:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:26:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:26:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:26:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-12-21 11:26:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:26:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:26:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:26:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:26:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-21 11:26:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2023-12-21 11:26:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-12-21 11:26:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-12-21 11:26:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-21 11:26:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-12-21 11:26:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-12-21 11:26:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2023-12-21 11:26:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2023-12-21 11:26:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2023-12-21 11:26:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2023-12-21 11:26:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2023-12-21 11:26:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2023-12-21 11:26:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2023-12-21 11:26:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2023-12-21 11:26:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2023-12-21 11:26:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2023-12-21 11:26:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2023-12-21 11:26:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2023-12-21 11:26:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,362 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 9 proven. 136 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2023-12-21 11:26:23,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:26:23,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989165085] [2023-12-21 11:26:23,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989165085] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:26:23,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671208099] [2023-12-21 11:26:23,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:26:23,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:26:23,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:26:23,364 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-21 11:26:23,376 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-21 11:26:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:23,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 1279 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 11:26:23,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:26:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2023-12-21 11:26:23,600 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:26:23,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671208099] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:26:23,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:26:23,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-12-21 11:26:23,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591584060] [2023-12-21 11:26:23,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:26:23,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:26:23,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:26:23,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:26:23,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:26:23,602 INFO L87 Difference]: Start difference. First operand 14384 states and 17605 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-21 11:26:26,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:26:26,747 INFO L93 Difference]: Finished difference Result 28213 states and 34582 transitions. [2023-12-21 11:26:26,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:26:26,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 371 [2023-12-21 11:26:26,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:26:26,775 INFO L225 Difference]: With dead ends: 28213 [2023-12-21 11:26:26,775 INFO L226 Difference]: Without dead ends: 13829 [2023-12-21 11:26:26,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 443 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-21 11:26:26,793 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 28 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 646 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-21 11:26:26,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 646 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:26:26,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13829 states. [2023-12-21 11:26:29,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13829 to 13829. [2023-12-21 11:26:29,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13829 states, 10627 states have (on average 1.2055142561400207) internal successors, (12811), 10840 states have internal predecessors, (12811), 2079 states have call successors, (2079), 1122 states have call predecessors, (2079), 1122 states have return successors, (2079), 1866 states have call predecessors, (2079), 2079 states have call successors, (2079) [2023-12-21 11:26:29,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13829 states to 13829 states and 16969 transitions. [2023-12-21 11:26:29,734 INFO L78 Accepts]: Start accepts. Automaton has 13829 states and 16969 transitions. Word has length 371 [2023-12-21 11:26:29,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:26:29,734 INFO L495 AbstractCegarLoop]: Abstraction has 13829 states and 16969 transitions. [2023-12-21 11:26:29,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-21 11:26:29,735 INFO L276 IsEmpty]: Start isEmpty. Operand 13829 states and 16969 transitions. [2023-12-21 11:26:29,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2023-12-21 11:26:29,751 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:26:29,752 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:26:29,757 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-21 11:26:29,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:26:29,958 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:26:29,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:26:29,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1029702023, now seen corresponding path program 1 times [2023-12-21 11:26:29,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:26:29,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085737533] [2023-12-21 11:26:29,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:26:29,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:26:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:26:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:26:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:26:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:26:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:26:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:26:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:26:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:26:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:26:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:26:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:26:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:26:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:26:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:26:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:26:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:26:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:26:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:26:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2023-12-21 11:26:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-12-21 11:26:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2023-12-21 11:26:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-21 11:26:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-12-21 11:26:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-21 11:26:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2023-12-21 11:26:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-12-21 11:26:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2023-12-21 11:26:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2023-12-21 11:26:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2023-12-21 11:26:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2023-12-21 11:26:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2023-12-21 11:26:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2023-12-21 11:26:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2023-12-21 11:26:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2023-12-21 11:26:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2023-12-21 11:26:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2023-12-21 11:26:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2023-12-21 11:26:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 88 proven. 172 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2023-12-21 11:26:30,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:26:30,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085737533] [2023-12-21 11:26:30,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085737533] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:26:30,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372920451] [2023-12-21 11:26:30,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:26:30,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:26:30,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:26:30,489 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-21 11:26:30,511 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-21 11:26:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:30,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-21 11:26:30,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:26:31,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 367 proven. 83 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2023-12-21 11:26:31,038 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:26:31,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 53 proven. 46 refuted. 0 times theorem prover too weak. 939 trivial. 0 not checked. [2023-12-21 11:26:31,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372920451] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:26:31,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:26:31,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 10] total 33 [2023-12-21 11:26:31,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113456847] [2023-12-21 11:26:31,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:26:31,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-21 11:26:31,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:26:31,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-21 11:26:31,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=971, Unknown=0, NotChecked=0, Total=1056 [2023-12-21 11:26:31,367 INFO L87 Difference]: Start difference. First operand 13829 states and 16969 transitions. Second operand has 33 states, 31 states have (on average 9.0) internal successors, (279), 28 states have internal predecessors, (279), 9 states have call successors, (65), 7 states have call predecessors, (65), 15 states have return successors, (65), 12 states have call predecessors, (65), 9 states have call successors, (65) [2023-12-21 11:26:38,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:26:38,145 INFO L93 Difference]: Finished difference Result 27567 states and 34223 transitions. [2023-12-21 11:26:38,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-12-21 11:26:38,146 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 9.0) internal successors, (279), 28 states have internal predecessors, (279), 9 states have call successors, (65), 7 states have call predecessors, (65), 15 states have return successors, (65), 12 states have call predecessors, (65), 9 states have call successors, (65) Word has length 378 [2023-12-21 11:26:38,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:26:38,175 INFO L225 Difference]: With dead ends: 27567 [2023-12-21 11:26:38,176 INFO L226 Difference]: Without dead ends: 13559 [2023-12-21 11:26:38,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 905 GetRequests, 817 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=765, Invalid=7067, Unknown=0, NotChecked=0, Total=7832 [2023-12-21 11:26:38,191 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 1366 mSDsluCounter, 6519 mSDsCounter, 0 mSdLazyCounter, 4624 mSolverCounterSat, 504 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1393 SdHoareTripleChecker+Valid, 6843 SdHoareTripleChecker+Invalid, 5128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 504 IncrementalHoareTripleChecker+Valid, 4624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-21 11:26:38,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1393 Valid, 6843 Invalid, 5128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [504 Valid, 4624 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-21 11:26:38,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13559 states. [2023-12-21 11:26:40,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13559 to 7983. [2023-12-21 11:26:40,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7983 states, 6206 states have (on average 1.1956171446986787) internal successors, (7420), 6278 states have internal predecessors, (7420), 1134 states have call successors, (1134), 642 states have call predecessors, (1134), 642 states have return successors, (1134), 1062 states have call predecessors, (1134), 1134 states have call successors, (1134) [2023-12-21 11:26:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7983 states to 7983 states and 9688 transitions. [2023-12-21 11:26:40,206 INFO L78 Accepts]: Start accepts. Automaton has 7983 states and 9688 transitions. Word has length 378 [2023-12-21 11:26:40,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:26:40,207 INFO L495 AbstractCegarLoop]: Abstraction has 7983 states and 9688 transitions. [2023-12-21 11:26:40,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 9.0) internal successors, (279), 28 states have internal predecessors, (279), 9 states have call successors, (65), 7 states have call predecessors, (65), 15 states have return successors, (65), 12 states have call predecessors, (65), 9 states have call successors, (65) [2023-12-21 11:26:40,207 INFO L276 IsEmpty]: Start isEmpty. Operand 7983 states and 9688 transitions. [2023-12-21 11:26:40,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2023-12-21 11:26:40,222 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:26:40,223 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:26:40,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-12-21 11:26:40,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:26:40,430 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:26:40,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:26:40,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1147352036, now seen corresponding path program 1 times [2023-12-21 11:26:40,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:26:40,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042924668] [2023-12-21 11:26:40,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:26:40,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:26:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:26:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:26:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:26:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:26:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:26:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:26:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:26:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:26:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:26:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:26:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:26:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:26:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:26:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:26:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:26:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:26:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:26:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:26:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:26:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2023-12-21 11:26:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2023-12-21 11:26:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-12-21 11:26:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2023-12-21 11:26:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2023-12-21 11:26:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2023-12-21 11:26:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2023-12-21 11:26:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2023-12-21 11:26:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2023-12-21 11:26:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2023-12-21 11:26:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2023-12-21 11:26:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2023-12-21 11:26:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2023-12-21 11:26:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2023-12-21 11:26:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2023-12-21 11:26:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2023-12-21 11:26:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2023-12-21 11:26:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2023-12-21 11:26:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2023-12-21 11:26:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 136 proven. 128 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2023-12-21 11:26:40,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:26:40,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042924668] [2023-12-21 11:26:40,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042924668] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:26:40,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413257047] [2023-12-21 11:26:40,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:26:40,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:26:40,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:26:40,888 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-21 11:26:40,895 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-21 11:26:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:41,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-21 11:26:41,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:26:41,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 431 proven. 87 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2023-12-21 11:26:41,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:26:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 51 proven. 34 refuted. 0 times theorem prover too weak. 1017 trivial. 0 not checked. [2023-12-21 11:26:41,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413257047] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:26:41,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:26:41,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 10] total 33 [2023-12-21 11:26:41,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700729701] [2023-12-21 11:26:41,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:26:41,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-21 11:26:41,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:26:41,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-21 11:26:41,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2023-12-21 11:26:41,843 INFO L87 Difference]: Start difference. First operand 7983 states and 9688 transitions. Second operand has 33 states, 31 states have (on average 9.64516129032258) internal successors, (299), 28 states have internal predecessors, (299), 10 states have call successors, (70), 8 states have call predecessors, (70), 15 states have return successors, (70), 12 states have call predecessors, (70), 10 states have call successors, (70) [2023-12-21 11:26:48,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:26:48,091 INFO L93 Difference]: Finished difference Result 17820 states and 21909 transitions. [2023-12-21 11:26:48,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-12-21 11:26:48,092 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 9.64516129032258) internal successors, (299), 28 states have internal predecessors, (299), 10 states have call successors, (70), 8 states have call predecessors, (70), 15 states have return successors, (70), 12 states have call predecessors, (70), 10 states have call successors, (70) Word has length 390 [2023-12-21 11:26:48,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:26:48,110 INFO L225 Difference]: With dead ends: 17820 [2023-12-21 11:26:48,111 INFO L226 Difference]: Without dead ends: 9603 [2023-12-21 11:26:48,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 931 GetRequests, 843 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1833 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=766, Invalid=7066, Unknown=0, NotChecked=0, Total=7832 [2023-12-21 11:26:48,119 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 800 mSDsluCounter, 6931 mSDsCounter, 0 mSdLazyCounter, 4869 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 7268 SdHoareTripleChecker+Invalid, 5098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 4869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:26:48,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 7268 Invalid, 5098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 4869 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-21 11:26:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9603 states. [2023-12-21 11:26:50,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9603 to 7620. [2023-12-21 11:26:50,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7620 states, 5900 states have (on average 1.1861016949152543) internal successors, (6998), 5973 states have internal predecessors, (6998), 1082 states have call successors, (1082), 637 states have call predecessors, (1082), 637 states have return successors, (1082), 1009 states have call predecessors, (1082), 1082 states have call successors, (1082) [2023-12-21 11:26:50,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7620 states to 7620 states and 9162 transitions. [2023-12-21 11:26:50,111 INFO L78 Accepts]: Start accepts. Automaton has 7620 states and 9162 transitions. Word has length 390 [2023-12-21 11:26:50,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:26:50,112 INFO L495 AbstractCegarLoop]: Abstraction has 7620 states and 9162 transitions. [2023-12-21 11:26:50,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 9.64516129032258) internal successors, (299), 28 states have internal predecessors, (299), 10 states have call successors, (70), 8 states have call predecessors, (70), 15 states have return successors, (70), 12 states have call predecessors, (70), 10 states have call successors, (70) [2023-12-21 11:26:50,112 INFO L276 IsEmpty]: Start isEmpty. Operand 7620 states and 9162 transitions. [2023-12-21 11:26:50,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2023-12-21 11:26:50,120 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:26:50,121 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 11, 9, 8, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:26:50,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-21 11:26:50,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:26:50,328 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:26:50,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:26:50,328 INFO L85 PathProgramCache]: Analyzing trace with hash 233055769, now seen corresponding path program 1 times [2023-12-21 11:26:50,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:26:50,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568984775] [2023-12-21 11:26:50,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:26:50,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:26:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:26:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:26:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:26:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:26:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:26:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:26:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:26:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:26:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:26:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:26:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:26:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:26:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:26:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:26:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:26:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:26:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:26:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:26:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:26:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-21 11:26:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2023-12-21 11:26:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-12-21 11:26:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-12-21 11:26:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-12-21 11:26:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-12-21 11:26:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2023-12-21 11:26:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2023-12-21 11:26:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2023-12-21 11:26:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2023-12-21 11:26:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2023-12-21 11:26:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2023-12-21 11:26:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2023-12-21 11:26:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2023-12-21 11:26:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2023-12-21 11:26:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2023-12-21 11:26:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2023-12-21 11:26:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2023-12-21 11:26:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2023-12-21 11:26:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2023-12-21 11:26:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2023-12-21 11:26:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 400 [2023-12-21 11:26:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 408 [2023-12-21 11:26:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1262 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 1220 trivial. 0 not checked. [2023-12-21 11:26:50,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:26:50,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568984775] [2023-12-21 11:26:50,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568984775] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:26:50,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138126697] [2023-12-21 11:26:50,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:26:50,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:26:50,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:26:50,511 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-21 11:26:50,513 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-21 11:26:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:50,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-21 11:26:50,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:26:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1262 backedges. 187 proven. 400 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2023-12-21 11:26:51,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:26:51,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1262 backedges. 23 proven. 30 refuted. 0 times theorem prover too weak. 1209 trivial. 0 not checked. [2023-12-21 11:26:51,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138126697] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:26:51,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:26:51,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 20 [2023-12-21 11:26:51,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584972656] [2023-12-21 11:26:51,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:26:51,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-21 11:26:51,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:26:51,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-21 11:26:51,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2023-12-21 11:26:51,389 INFO L87 Difference]: Start difference. First operand 7620 states and 9162 transitions. Second operand has 20 states, 20 states have (on average 15.15) internal successors, (303), 17 states have internal predecessors, (303), 7 states have call successors, (95), 7 states have call predecessors, (95), 9 states have return successors, (94), 9 states have call predecessors, (94), 7 states have call successors, (94) [2023-12-21 11:27:00,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:27:00,940 INFO L93 Difference]: Finished difference Result 29707 states and 36058 transitions. [2023-12-21 11:27:00,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2023-12-21 11:27:00,941 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 15.15) internal successors, (303), 17 states have internal predecessors, (303), 7 states have call successors, (95), 7 states have call predecessors, (95), 9 states have return successors, (94), 9 states have call predecessors, (94), 7 states have call successors, (94) Word has length 421 [2023-12-21 11:27:00,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:27:00,991 INFO L225 Difference]: With dead ends: 29707 [2023-12-21 11:27:00,991 INFO L226 Difference]: Without dead ends: 22680 [2023-12-21 11:27:01,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1046 GetRequests, 941 SyntacticMatches, 9 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2950 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=963, Invalid=8543, Unknown=0, NotChecked=0, Total=9506 [2023-12-21 11:27:01,005 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 1746 mSDsluCounter, 4126 mSDsCounter, 0 mSdLazyCounter, 4674 mSolverCounterSat, 587 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 4509 SdHoareTripleChecker+Invalid, 5261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 587 IncrementalHoareTripleChecker+Valid, 4674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-21 11:27:01,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 4509 Invalid, 5261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [587 Valid, 4674 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-21 11:27:01,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22680 states. [2023-12-21 11:27:04,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22680 to 11985. [2023-12-21 11:27:04,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11985 states, 9310 states have (on average 1.1792696025778733) internal successors, (10979), 9419 states have internal predecessors, (10979), 1668 states have call successors, (1668), 1006 states have call predecessors, (1668), 1006 states have return successors, (1668), 1559 states have call predecessors, (1668), 1668 states have call successors, (1668) [2023-12-21 11:27:04,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11985 states to 11985 states and 14315 transitions. [2023-12-21 11:27:04,195 INFO L78 Accepts]: Start accepts. Automaton has 11985 states and 14315 transitions. Word has length 421 [2023-12-21 11:27:04,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:27:04,195 INFO L495 AbstractCegarLoop]: Abstraction has 11985 states and 14315 transitions. [2023-12-21 11:27:04,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 15.15) internal successors, (303), 17 states have internal predecessors, (303), 7 states have call successors, (95), 7 states have call predecessors, (95), 9 states have return successors, (94), 9 states have call predecessors, (94), 7 states have call successors, (94) [2023-12-21 11:27:04,196 INFO L276 IsEmpty]: Start isEmpty. Operand 11985 states and 14315 transitions. [2023-12-21 11:27:04,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2023-12-21 11:27:04,203 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:27:04,203 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-21 11:27:04,211 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-21 11:27:04,409 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,SelfDestructingSolverStorable45 [2023-12-21 11:27:04,410 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:27:04,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:27:04,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1676009123, now seen corresponding path program 1 times [2023-12-21 11:27:04,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:27:04,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640402036] [2023-12-21 11:27:04,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:27:04,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:27:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:27:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:27:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:27:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:27:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:27:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:27:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:27:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:27:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:27:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:27:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:27:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:27:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:27:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:27:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:27:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:27:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 11:27:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 11:27:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:27:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-21 11:27:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2023-12-21 11:27:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-21 11:27:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-21 11:27:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-12-21 11:27:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2023-12-21 11:27:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-12-21 11:27:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2023-12-21 11:27:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2023-12-21 11:27:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2023-12-21 11:27:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2023-12-21 11:27:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2023-12-21 11:27:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2023-12-21 11:27:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2023-12-21 11:27:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2023-12-21 11:27:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2023-12-21 11:27:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2023-12-21 11:27:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2023-12-21 11:27:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2023-12-21 11:27:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2023-12-21 11:27:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 393 [2023-12-21 11:27:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 401 [2023-12-21 11:27:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 409 [2023-12-21 11:27:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1299 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2023-12-21 11:27:04,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:27:04,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640402036] [2023-12-21 11:27:04,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640402036] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:27:04,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757673797] [2023-12-21 11:27:04,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:27:04,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:27:04,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:27:04,716 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 11:27:04,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-12-21 11:27:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:27:04,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 1449 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-21 11:27:04,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:27:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1299 backedges. 560 proven. 89 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2023-12-21 11:27:05,202 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:27:05,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1299 backedges. 75 proven. 53 refuted. 0 times theorem prover too weak. 1171 trivial. 0 not checked. [2023-12-21 11:27:05,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757673797] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:27:05,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:27:05,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 27 [2023-12-21 11:27:05,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375409531] [2023-12-21 11:27:05,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:27:05,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-21 11:27:05,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:27:05,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-21 11:27:05,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2023-12-21 11:27:05,583 INFO L87 Difference]: Start difference. First operand 11985 states and 14315 transitions. Second operand has 27 states, 27 states have (on average 9.851851851851851) internal successors, (266), 22 states have internal predecessors, (266), 5 states have call successors, (76), 9 states have call predecessors, (76), 15 states have return successors, (75), 9 states have call predecessors, (75), 5 states have call successors, (75) [2023-12-21 11:27:20,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:27:20,397 INFO L93 Difference]: Finished difference Result 40482 states and 48883 transitions. [2023-12-21 11:27:20,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2023-12-21 11:27:20,397 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 9.851851851851851) internal successors, (266), 22 states have internal predecessors, (266), 5 states have call successors, (76), 9 states have call predecessors, (76), 15 states have return successors, (75), 9 states have call predecessors, (75), 5 states have call successors, (75) Word has length 424 [2023-12-21 11:27:20,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:27:20,455 INFO L225 Difference]: With dead ends: 40482 [2023-12-21 11:27:20,455 INFO L226 Difference]: Without dead ends: 28998 [2023-12-21 11:27:20,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1099 GetRequests, 954 SyntacticMatches, 1 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6987 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2310, Invalid=18860, Unknown=0, NotChecked=0, Total=21170 [2023-12-21 11:27:20,471 INFO L413 NwaCegarLoop]: 601 mSDtfsCounter, 3150 mSDsluCounter, 7894 mSDsCounter, 0 mSdLazyCounter, 6430 mSolverCounterSat, 1344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3155 SdHoareTripleChecker+Valid, 8495 SdHoareTripleChecker+Invalid, 7774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1344 IncrementalHoareTripleChecker+Valid, 6430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-21 11:27:20,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3155 Valid, 8495 Invalid, 7774 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1344 Valid, 6430 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-21 11:27:20,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28998 states. [2023-12-21 11:27:25,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28998 to 17496. [2023-12-21 11:27:25,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17496 states, 13589 states have (on average 1.1655015085731106) internal successors, (15838), 13746 states have internal predecessors, (15838), 2361 states have call successors, (2361), 1545 states have call predecessors, (2361), 1545 states have return successors, (2361), 2204 states have call predecessors, (2361), 2361 states have call successors, (2361) [2023-12-21 11:27:25,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17496 states to 17496 states and 20560 transitions. [2023-12-21 11:27:25,791 INFO L78 Accepts]: Start accepts. Automaton has 17496 states and 20560 transitions. Word has length 424 [2023-12-21 11:27:25,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:27:25,792 INFO L495 AbstractCegarLoop]: Abstraction has 17496 states and 20560 transitions. [2023-12-21 11:27:25,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.851851851851851) internal successors, (266), 22 states have internal predecessors, (266), 5 states have call successors, (76), 9 states have call predecessors, (76), 15 states have return successors, (75), 9 states have call predecessors, (75), 5 states have call successors, (75) [2023-12-21 11:27:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 17496 states and 20560 transitions. [2023-12-21 11:27:25,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2023-12-21 11:27:25,831 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:27:25,831 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:27:25,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-12-21 11:27:26,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2023-12-21 11:27:26,038 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:27:26,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:27:26,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1384740635, now seen corresponding path program 1 times [2023-12-21 11:27:26,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:27:26,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254543097] [2023-12-21 11:27:26,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:27:26,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:27:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 11:27:26,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 11:27:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 11:27:26,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 11:27:26,207 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 11:27:26,207 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 11:27:26,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-12-21 11:27:26,210 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-21 11:27:26,213 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 11:27:26,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 11:27:26 BoogieIcfgContainer [2023-12-21 11:27:26,430 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 11:27:26,431 INFO L158 Benchmark]: Toolchain (without parser) took 195922.93ms. Allocated memory was 252.7MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 200.9MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2023-12-21 11:27:26,431 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 189.8MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 11:27:26,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.29ms. Allocated memory is still 252.7MB. Free memory was 200.7MB in the beginning and 184.0MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-21 11:27:26,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.85ms. Allocated memory is still 252.7MB. Free memory was 184.0MB in the beginning and 181.0MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 11:27:26,431 INFO L158 Benchmark]: Boogie Preprocessor took 53.86ms. Allocated memory is still 252.7MB. Free memory was 181.0MB in the beginning and 177.3MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 11:27:26,431 INFO L158 Benchmark]: RCFGBuilder took 599.47ms. Allocated memory is still 252.7MB. Free memory was 177.1MB in the beginning and 195.7MB in the end (delta: -18.6MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. [2023-12-21 11:27:26,431 INFO L158 Benchmark]: TraceAbstraction took 194917.23ms. Allocated memory was 252.7MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 194.6MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2023-12-21 11:27:26,435 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 189.8MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 307.29ms. Allocated memory is still 252.7MB. Free memory was 200.7MB in the beginning and 184.0MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.85ms. Allocated memory is still 252.7MB. Free memory was 184.0MB in the beginning and 181.0MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.86ms. Allocated memory is still 252.7MB. Free memory was 181.0MB in the beginning and 177.3MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 599.47ms. Allocated memory is still 252.7MB. Free memory was 177.1MB in the beginning and 195.7MB in the end (delta: -18.6MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. * TraceAbstraction took 194917.23ms. Allocated memory was 252.7MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 194.6MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 537]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] msg_t nomsg = (msg_t )-1; [L24] port_t g1v ; [L25] int8_t g1v_old ; [L26] int8_t g1v_new ; [L27] port_t g2v ; [L28] int8_t g2v_old ; [L29] int8_t g2v_new ; [L30] port_t g3v ; [L31] int8_t g3v_old ; [L32] int8_t g3v_new ; [L39] _Bool gate1Failed ; [L40] _Bool gate2Failed ; [L41] _Bool gate3Failed ; [L42] msg_t VALUE1 ; [L43] msg_t VALUE2 ; [L44] msg_t VALUE3 ; [L46] _Bool gate1Failed_History_0 ; [L47] _Bool gate1Failed_History_1 ; [L48] _Bool gate1Failed_History_2 ; [L49] _Bool gate2Failed_History_0 ; [L50] _Bool gate2Failed_History_1 ; [L51] _Bool gate2Failed_History_2 ; [L52] _Bool gate3Failed_History_0 ; [L53] _Bool gate3Failed_History_1 ; [L54] _Bool gate3Failed_History_2 ; [L55] int8_t votedValue_History_0 ; [L56] int8_t votedValue_History_1 ; [L57] int8_t votedValue_History_2 ; [L479] int c1 ; [L480] int i2 ; [L483] c1 = 0 [L484] gate1Failed = __VERIFIER_nondet_bool() [L485] gate2Failed = __VERIFIER_nondet_bool() [L486] gate3Failed = __VERIFIER_nondet_bool() [L487] VALUE1 = __VERIFIER_nondet_char() [L488] VALUE2 = __VERIFIER_nondet_char() [L489] VALUE3 = __VERIFIER_nondet_char() [L490] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L491] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L492] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L493] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L494] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L495] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L496] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L497] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L498] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L499] votedValue_History_0 = __VERIFIER_nondet_char() [L500] votedValue_History_1 = __VERIFIER_nondet_char() [L501] votedValue_History_2 = __VERIFIER_nondet_char() [L502] CALL, EXPR init() [L206] int tmp ; [L207] int tmp___0 ; [L208] int tmp___1 ; [L209] 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] [L212] 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] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [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] [L74] 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] [L75] 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] [L76] 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] [L129] 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] [L130] COND TRUE historyIndex == 0 [L131] 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] [L76] 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] [L76] tmp = (int )read_history_bool(0, 0) [L77] 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] [L99] 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] [L74] 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] [L75] 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] [L76] 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] [L129] 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] [L130] COND TRUE historyIndex == 0 [L131] 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] [L76] 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] [L76] tmp = (int )read_history_bool(0, 0) [L77] 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] [L99] 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] [L74] 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] [L75] 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] [L76] 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] [L129] 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] [L130] COND TRUE historyIndex == 0 [L131] 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] [L76] 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] [L76] tmp = (int )read_history_bool(0, 0) [L77] 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] [L99] 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] [L74] 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] [L101] 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] [L212] 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] [L212] tmp = add_history_type(0) [L213] 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] [L216] 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] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [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] [L74] 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] [L75] 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] [L81] 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] [L82] 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] [L129] 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] [L139] 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] [L140] COND TRUE historyIndex == 0 [L141] 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] [L82] 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] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] 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] [L99] 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] [L74] 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] [L75] 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] [L81] 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] [L82] 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] [L129] 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] [L139] 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] [L140] COND TRUE historyIndex == 0 [L141] 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] [L82] 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] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] 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] [L99] 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] [L74] 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] [L75] 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] [L81] 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] [L82] 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] [L129] 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] [L139] 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] [L140] COND TRUE historyIndex == 0 [L141] 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] [L82] 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] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] 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] [L99] 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] [L74] 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] [L101] 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] [L216] 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] [L216] tmp___0 = add_history_type(1) [L217] 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] [L220] 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] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [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] [L74] 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] [L75] 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] [L81] 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] [L87] 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] [L88] 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] [L129] 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] [L139] 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] [L149] 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] [L150] COND TRUE historyIndex == 0 [L151] 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] [L88] 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] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] 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] [L99] 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] [L74] 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] [L75] 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] [L81] 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] [L87] 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] [L88] 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] [L129] 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] [L139] 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] [L149] 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] [L150] COND TRUE historyIndex == 0 [L151] 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] [L88] 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] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] 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] [L99] 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] [L74] 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] [L75] 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] [L81] 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] [L87] 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] [L88] 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] [L129] 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] [L139] 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] [L149] 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] [L150] COND TRUE historyIndex == 0 [L151] 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] [L88] 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] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] 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] [L99] 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] [L74] 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] [L101] 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] [L220] 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] [L220] tmp___1 = add_history_type(2) [L221] 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] [L224] 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] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [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] [L74] 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] [L75] 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] [L81] 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] [L87] 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] [L93] 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] [L94] 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] [L109] 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] [L110] COND TRUE historyIndex == 0 [L111] 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] [L94] 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] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] 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] [L99] 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] [L74] 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] [L75] 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] [L81] 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] [L87] 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] [L93] 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] [L94] 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] [L109] 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] [L110] COND TRUE historyIndex == 0 [L111] 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] [L94] 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] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] 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] [L99] 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] [L74] 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] [L75] 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] [L81] 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] [L87] 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] [L93] 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] [L94] 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] [L109] 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] [L110] COND TRUE historyIndex == 0 [L111] 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] [L94] 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] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] 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] [L99] 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] [L74] 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] [L101] 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] [L224] 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] [L224] tmp___2 = add_history_type(3) [L225] COND FALSE !(! tmp___2) [L228] 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] [L502] RET, EXPR init() [L502] i2 = init() [L503] CALL assume_abort_if_not(i2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(cond)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(cond)=1, cond=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L503] RET assume_abort_if_not(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] [L504] g1v_old = nomsg [L505] g1v_new = nomsg [L506] g2v_old = nomsg [L507] g2v_new = nomsg [L508] g3v_old = nomsg [L509] g3v_new = nomsg [L510] 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] [L511] COND TRUE 1 [L513] CALL gate1_each_pals_period() [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [L347] CALL write_history_bool(0, gate1Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=2, \old(gate1Failed_History_2)=3, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=6, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=5, \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=2, gate1Failed_History_2=3, gate2Failed_History_0=0, gate2Failed_History_1=6, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L184] COND TRUE history_id == 0 [L185] gate1Failed_History_2 = gate1Failed_History_1 [L186] gate1Failed_History_1 = gate1Failed_History_0 [L187] gate1Failed_History_0 = buf VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=2, \old(gate1Failed_History_2)=3, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=6, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=5, \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=2, gate2Failed_History_0=0, gate2Failed_History_1=6, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, history_id=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L347] 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=2, gate2Failed_History_0=0, gate2Failed_History_1=6, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L348] COND TRUE \read(gate1Failed) [L349] 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=2, gate2Failed_History_0=0, gate2Failed_History_1=6, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L513] RET gate1_each_pals_period() [L514] CALL gate2_each_pals_period() [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L378] CALL write_history_bool(1, gate2Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=6, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=5, \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=2, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=6, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L184] 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)=2, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=6, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=5, \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=2, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=6, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L189] COND TRUE history_id == 1 [L190] gate2Failed_History_2 = gate2Failed_History_1 [L191] gate2Failed_History_1 = gate2Failed_History_0 [L192] gate2Failed_History_0 = buf VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=6, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=5, \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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L378] 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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L379] COND TRUE \read(gate2Failed) [L380] 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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L514] RET gate2_each_pals_period() [L515] CALL gate3_each_pals_period() [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L409] CALL write_history_bool(2, gate3Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=5, \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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L184] 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)=2, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=5, \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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L189] 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)=2, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=5, \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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L194] COND TRUE history_id == 2 [L195] gate3Failed_History_2 = gate3Failed_History_1 [L196] gate3Failed_History_1 = gate3Failed_History_0 [L197] gate3Failed_History_0 = buf VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=5, \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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L409] 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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L410] COND FALSE !(\read(gate3Failed)) [L414] tmp = __VERIFIER_nondet_char() [L415] 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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L416] COND TRUE (int )next_state == 0 [L417] 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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L427] CALL assume_abort_if_not((_Bool )tmp___0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(cond)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L37] COND FALSE !(!cond) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(cond)=1, cond=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L427] RET assume_abort_if_not((_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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L428] 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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L515] RET gate3_each_pals_period() [L516] CALL voter() [L434] int8_t voted_value ; [L437] voted_value = nomsg [L438] VALUE1 = g1v_old [L439] g1v_old = nomsg [L440] VALUE2 = g2v_old [L441] g2v_old = nomsg [L442] VALUE3 = g3v_old [L443] g3v_old = nomsg VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L444] COND TRUE (int )VALUE1 == (int )VALUE2 [L445] 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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L473] CALL write_history_int8(3, voted_value) [L169] COND TRUE history_id == 3 [L170] votedValue_History_2 = votedValue_History_1 [L171] votedValue_History_1 = votedValue_History_0 [L172] votedValue_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=-1, \old(history_id)=3, buf=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L473] RET write_history_int8(3, voted_value) [L516] RET voter() [L517] g1v_old = g1v_new [L518] g1v_new = nomsg [L519] g2v_old = g2v_new [L520] g2v_new = nomsg [L521] g3v_old = g3v_new [L522] g3v_new = nomsg [L523] CALL, EXPR check() [L233] int tmp ; [L234] int temp_count ; [L235] int8_t tmp___0 ; [L236] int8_t tmp___1 ; [L237] int8_t tmp___2 ; [L238] _Bool tmp___3 ; [L239] _Bool tmp___4 ; [L240] _Bool tmp___5 ; [L241] int8_t tmp___6 ; [L242] _Bool tmp___7 ; [L243] _Bool tmp___8 ; [L244] _Bool tmp___9 ; [L245] int8_t tmp___10 ; [L246] int8_t tmp___11 ; [L247] int8_t tmp___12 ; [L248] int8_t tmp___13 ; [L249] int8_t tmp___14 ; VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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 !(! 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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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 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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L258] COND TRUE ! gate3Failed [L259] 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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L263] CALL assume_abort_if_not((_Bool )tmp) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(cond)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L37] COND FALSE !(!cond) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(cond)=1, cond=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L263] RET assume_abort_if_not((_Bool )tmp) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L264] CALL, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L129] COND TRUE history_id == 0 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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 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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L264] RET, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L264] tmp___3 = read_history_bool(0, 1) [L265] COND TRUE ! tmp___3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L266] CALL, EXPR read_history_bool(1, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L139] COND TRUE history_id == 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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 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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L143] COND TRUE historyIndex == 1 [L144] return (gate2Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L266] RET, EXPR read_history_bool(1, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L266] tmp___4 = read_history_bool(1, 1) [L267] COND TRUE ! tmp___4 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L268] CALL, EXPR read_history_bool(2, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L139] COND FALSE !(history_id == 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L149] COND TRUE history_id == 2 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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 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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L153] COND TRUE historyIndex == 1 [L154] return (gate3Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L268] RET, EXPR read_history_bool(2, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L268] tmp___5 = read_history_bool(2, 1) [L269] COND TRUE ! tmp___5 [L270] temp_count = 0 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L271] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L271] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L271] tmp___0 = read_history_int8(3, 0) [L272] COND TRUE (int )VALUE1 == (int )tmp___0 [L273] temp_count ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L275] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L275] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L275] tmp___1 = read_history_int8(3, 0) [L276] COND TRUE (int )VALUE2 == (int )tmp___1 [L277] temp_count ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L279] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L279] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L279] tmp___2 = read_history_int8(3, 0) [L280] COND TRUE (int )VALUE3 == (int )tmp___2 [L281] temp_count ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L283] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L297] COND FALSE !(! (temp_count > 1)) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L303] CALL, EXPR read_history_int8(3, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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 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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L113] COND TRUE historyIndex == 1 [L114] return (votedValue_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=3, \result=-2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L303] RET, EXPR read_history_int8(3, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L303] tmp___10 = read_history_int8(3, 1) [L304] COND FALSE !((int )tmp___10 > -2) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L323] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L323] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L323] tmp___11 = read_history_int8(3, 0) [L324] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L336] return (1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \result=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L523] RET, EXPR check() [L523] c1 = check() [L524] 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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L535] 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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L524] 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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L511] COND TRUE 1 [L513] CALL gate1_each_pals_period() [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [L347] CALL write_history_bool(0, gate1Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \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=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, 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] [L184] COND TRUE history_id == 0 [L185] gate1Failed_History_2 = gate1Failed_History_1 [L186] gate1Failed_History_1 = gate1Failed_History_0 [L187] gate1Failed_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \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=6, 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] [L347] RET write_history_bool(0, gate1Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-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=6, 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] [L348] COND FALSE !(\read(gate1Failed)) [L352] tmp = __VERIFIER_nondet_char() [L353] next_state = tmp VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-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=6, 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] [L354] COND TRUE (int )next_state == 0 [L355] tmp___0 = 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-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=6, 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] [L365] CALL assume_abort_if_not((_Bool )tmp___0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(cond)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-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=6, 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] [L37] COND FALSE !(!cond) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(cond)=1, cond=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-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=6, 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] [L365] RET assume_abort_if_not((_Bool )tmp___0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-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=6, 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] [L366] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-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=6, 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] [L513] RET gate1_each_pals_period() [L514] CALL gate2_each_pals_period() [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L378] CALL write_history_bool(1, gate2Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=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)=6, \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=6, 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] [L184] 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)=6, \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=6, 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] [L189] COND TRUE history_id == 1 [L190] gate2Failed_History_2 = gate2Failed_History_1 [L191] gate2Failed_History_1 = gate2Failed_History_0 [L192] gate2Failed_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=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)=6, \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] [L378] RET write_history_bool(1, gate2Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-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] [L379] COND TRUE \read(gate2Failed) [L380] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-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] [L514] RET gate2_each_pals_period() [L515] CALL gate3_each_pals_period() [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L409] CALL write_history_bool(2, gate3Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=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] [L184] 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] [L189] 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] [L194] COND TRUE history_id == 2 [L195] gate3Failed_History_2 = gate3Failed_History_1 [L196] gate3Failed_History_1 = gate3Failed_History_0 [L197] gate3Failed_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=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] [L409] RET write_history_bool(2, gate3Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-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] [L410] COND TRUE \read(gate3Failed) [L411] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-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] [L515] RET gate3_each_pals_period() [L516] CALL voter() [L434] int8_t voted_value ; [L437] voted_value = nomsg [L438] VALUE1 = g1v_old [L439] g1v_old = nomsg [L440] VALUE2 = g2v_old [L441] g2v_old = nomsg [L442] VALUE3 = g3v_old [L443] g3v_old = nomsg VAL [VALUE1=-1, VALUE2=-1, VALUE3=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] [L444] COND TRUE (int )VALUE1 == (int )VALUE2 [L445] 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] [L473] CALL write_history_int8(3, voted_value) [L169] COND TRUE history_id == 3 [L170] votedValue_History_2 = votedValue_History_1 [L171] votedValue_History_1 = votedValue_History_0 [L172] votedValue_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=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] [L473] RET write_history_int8(3, voted_value) [L516] RET voter() [L517] g1v_old = g1v_new [L518] g1v_new = nomsg [L519] g2v_old = g2v_new [L520] g2v_new = nomsg [L521] g3v_old = g3v_new [L522] g3v_new = nomsg [L523] CALL, EXPR check() [L233] int tmp ; [L234] int temp_count ; [L235] int8_t tmp___0 ; [L236] int8_t tmp___1 ; [L237] int8_t tmp___2 ; [L238] _Bool tmp___3 ; [L239] _Bool tmp___4 ; [L240] _Bool tmp___5 ; [L241] int8_t tmp___6 ; [L242] _Bool tmp___7 ; [L243] _Bool tmp___8 ; [L244] _Bool tmp___9 ; [L245] int8_t tmp___10 ; [L246] int8_t tmp___11 ; [L247] int8_t tmp___12 ; [L248] int8_t tmp___13 ; [L249] int8_t tmp___14 ; VAL [VALUE1=-1, VALUE2=-1, VALUE3=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] [L252] COND TRUE ! gate1Failed [L253] 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] [L263] CALL assume_abort_if_not((_Bool )tmp) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(cond)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=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] [L37] COND FALSE !(!cond) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(cond)=1, cond=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=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] [L263] RET assume_abort_if_not((_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] [L264] 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] [L129] 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] [L130] 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] [L133] COND TRUE historyIndex == 1 [L134] 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] [L264] 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] [L264] tmp___3 = read_history_bool(0, 1) [L265] 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] [L303] 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] [L109] 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] [L110] 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] [L113] COND TRUE historyIndex == 1 [L114] 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] [L303] 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] [L303] tmp___10 = read_history_int8(3, 1) [L304] 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] [L305] 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] [L109] 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] [L110] COND TRUE historyIndex == 0 [L111] 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] [L305] 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] [L305] tmp___6 = read_history_int8(3, 0) [L306] 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] [L307] 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] [L129] 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] [L130] 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] [L133] COND TRUE historyIndex == 1 [L134] 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] [L307] 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] [L307] tmp___7 = read_history_bool(0, 1) [L308] 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] [L309] 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] [L129] 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] [L139] 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] [L140] 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] [L143] COND TRUE historyIndex == 1 [L144] 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] [L309] 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] [L309] tmp___8 = read_history_bool(1, 1) [L310] 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] [L311] 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] [L129] 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] [L139] 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] [L149] 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] [L150] 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] [L153] COND TRUE historyIndex == 1 [L154] 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] [L311] 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] [L311] tmp___9 = read_history_bool(2, 1) [L312] COND TRUE ! tmp___9 [L313] 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] [L523] RET, EXPR check() [L523] c1 = check() [L524] 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] [L535] 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] [L537] 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 7 procedures, 174 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 194.7s, OverallIterations: 48, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 139.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31135 SdHoareTripleChecker+Valid, 36.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30707 mSDsluCounter, 111885 SdHoareTripleChecker+Invalid, 31.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97444 mSDsCounter, 10510 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 82812 IncrementalHoareTripleChecker+Invalid, 93322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10510 mSolverCounterUnsat, 14441 mSDtfsCounter, 82812 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14166 GetRequests, 12238 SyntacticMatches, 37 SemanticMatches, 1891 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215662 ImplicationChecksByTransitivity, 50.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17496occurred in iteration=47, InterpolantAutomatonStates: 1702, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 28.1s AutomataMinimizationTime, 47 MinimizatonAttempts, 142915 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 17445 NumberOfCodeBlocks, 17445 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 20798 ConstructedInterpolants, 0 QuantifiedInterpolants, 42341 SizeOfPredicates, 63 NumberOfNonLiveVariables, 21213 ConjunctsInSsa, 372 ConjunctsInUnsatCore, 80 InterpolantComputations, 37 PerfectInterpolantSequences, 51329/53844 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-21 11:27:26,470 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...